A comment on parallel-machine scheduling under a grade of service provision to minimize makespan

Authors:
Gerhard J. Woeginger
Affiliations:
Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Venue:
Information Processing Letters
Year:
2009

Citing 4
Cited 0

Exact and Approximate Algorithms for Scheduling Nonidentical Processors

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

INFORMS Journal on Computing
An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan

Information Processing Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract

We derive two fully polynomial time approximation schemes for parallel-machine scheduling on a fixed number of machines subject to a grade of service provision. Both results substantially simplify a recent construction by Ji and Cheng [IPL 108 (2008) 171-174].