A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs

Abstract In this paper we study the NP-hard problem of scheduling n deteriorating jobs on m identical parallel machines to minimize the makespan. Each job's processing time is a linear nondecreasing function of its start time. We present a fully polynomial-time approximation scheme for the problem, thus establishing that the problem is NP-hard in the ordinary sense only.

[1]  Anand S. Kunnathur,et al.  Optimal repayment policies for multiple loans , 1987 .

[2]  Wieslaw Kubiak,et al.  A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs , 1998, J. Heuristics.

[3]  Hui-Ling Yang.  A comparison among various partial backlogging inventory lot-size models for deteriorating items on the basis of maximum profit , 2005 .

[4]  Yi-Chih Hsieh,et al.  Scheduling linearly deteriorating jobs on multiple machines , 1997 .

[5]  C. T. Ng,et al.  Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables , 2007 .

[6]  Jatinder N. D. Gupta,et al.  Single facility scheduling with nonlinear processing times , 1988 .

[7]  Gur Mosheiov,et al.  Complexity analysis of job-shop scheduling with deteriorating jobs , 2002, Discret. Appl. Math..

[8]  Béla Bollobás,et al.  Erratum to “Parallel machine scheduling with time dependent processing times” [Discrete Appl. Math. 70 (1996) 81–93] , 1997 .

[9]  Gur Mosheiov,et al.  Multi-Machine Scheduling With Linear Deterioration , 1998 .

[10]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[11]  Zhi-Long Chen.  Parallel Machine Scheduling with Time Dependent Processing Times , 1996, Discret. Appl. Math..

[12]  Bertrand M. T. Lin,et al.  A concise survey of scheduling with time-dependent processing times , 2004, Eur. J. Oper. Res..

[13]  Bahram Alidaee,et al.  Scheduling with time dependent processing times: Review and extensions , 1999, J. Oper. Res. Soc..

[14]  T. C. Edwin Cheng,et al.  Scheduling jobs with piecewise linear decreasing processing times , 2003 .

[15]  Stanisław Gawiejnowicz,et al.  NP-hard cases in scheduling deteriorating jobs on dedicated machines , 2001, J. Oper. Res. Soc..

[16]  Wen-Chiung Lee,et al.  Two-machine flowshop scheduling to minimize mean flow time under linear deterioration , 2006 .

[17]  Jin-Yi Cai,et al.  On A Scheduling Problem of Time Deteriorating Jobs , 1998, J. Complex..