Approximability of average completion time scheduling on unrelated machines
Work
Year: 2016
Type: article
Abstract: We show that minimizing the average job completion time on unrelated machines is $$\mathcal {APX}$$ -hard if preemption of jobs is allowed. This provides one of the last missing pieces in the complexi... more
Source: Mathematical Programming
Author René Sitters
Institution Vrije Universiteit Amsterdam
Cites: 23
Cited by: 7
Related to: 10
FWCI: 0.738
Citation percentile (by year/subfield): 78.89
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Sustainable Development Goal Decent work and economic growth
Open Access status: hybrid
APC paid (est): $2,890