A comment on parallel-machine scheduling under a grade of service provision to minimize makespan
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]. (C) 2008 Elsevier B.V. All rights reserved.
scheduling grade of service eligibility