Approximability of average completion time scheduling on unrelated machines

We show that minimizing the average job completion time on unrelated machines is APX -hard if preemption of jobs is allowed. This provides one of the last missing pieces in the complexity classification of machine scheduling with (weighted) sum of completion times objective. The proof is based on a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematical programming Ročník 161; číslo 1-2; s. 135 - 158
Hlavní autor: Sitters, René
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.01.2017
Springer Nature B.V
Témata:
Algorithms
Approximation
Calculus of Variations and Optimal Control; Optimization
Classification
Combinatorics
Completion time
Employment
Full Length Paper
Job shops
Linear programming
Lower bounds
Mathematical analysis
Mathematical and Computational Physics
Mathematical Methods in Physics
Mathematical programming
Mathematics
Mathematics and Statistics
Mathematics of Computing
Mixed integer
Numerical Analysis
Preemption
Quadratic programming
Scheduling
Studies
Texts
Theoretical
hardness
68W25 Approximation algorithms
Approximation algorithms
90B35 Scheduling theory, deterministic
Scheduling
68Q25 Analysis of algorithms and problem complexity
Quadratic programming
Average completion time
ISSN:0025-5610, 1436-4646
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We show that minimizing the average job completion time on unrelated machines is APX -hard if preemption of jobs is allowed. This provides one of the last missing pieces in the complexity classification of machine scheduling with (weighted) sum of completion times objective. The proof is based on a mixed integer linear program. This means that verification of the reduction is partly done by an ILP-solver. This gives a concise proof which is easy to verify. In addition, we give a deterministic 1.698-approximation algorithm for the weighted version of the problem. The improvement is made by modifying and combining known algorithms and by the use of new lower bounds. These results improve on the known NP -hardness and 2-approximability.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0025-5610
1436-4646
DOI:10.1007/s10107-016-1004-8