Approximation algorithms for the multiprocessor scheduling with submodular penalties
- 20 March 2021
- journal article
- research article
- Published by Springer Nature in Optimization Letters
- Vol. 15 (6) , 2165-2180
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (61662088)
This publication has 23 references indexed in Scilit:
- A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular PenaltiesAlgorithmica, 2011
- An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral VariablesSIAM Journal on Discrete Mathematics, 2010
- A push-relabel framework for submodular function minimization and applications to parametric optimizationDiscrete Applied Mathematics, 2003
- Multiprocessor Scheduling with RejectionSIAM Journal on Discrete Mathematics, 2000
- Approximation algorithms for scheduling unrelated parallel machinesMathematical Programming, 1990
- Using dual approximation algorithms for scheduling problems theoretical and practical resultsJournal of the ACM, 1987
- Analysis of a linear programming heuristic for scheduling unrelated parallel machinesDiscrete Applied Mathematics, 1985
- Submodular functions and convexity1983
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Bounds for Certain Multiprocessing AnomaliesBell System Technical Journal, 1966