Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan

We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. The objective is to minimize the makespan. We first show that the problem can be solved optimally by 0-1 integer programming. We then prove that the problem is NP-hard in the ordinary sense and there exists a fully polynomial time approximation scheme for it.

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

[2]  Chwen-Tzeng Su,et al.  Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration , 2008, Comput. Math. Appl..

[3]  Sushil K. Gupta,et al.  Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem , 1990 .

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[6]  T. C. Edwin Cheng,et al.  Scheduling linear deteriorating jobs with an availability constraint on a single machine , 2006, Theor. Comput. Sci..

[7]  Chung Yee Lee,et al.  Scheduling maintenance and semiresumable jobs on a single machine , 1999 .

[8]  Sid Browne,et al.  Scheduling Deteriorating Jobs on a Single Processor , 1990, Oper. Res..

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

[10]  Michael Pinedo,et al.  Current trends in deterministic scheduling , 1997, Ann. Oper. Res..

[11]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1981, J. Algorithms.

[12]  Chung-Yee Lee,et al.  Machine scheduling with an availability constraint , 1996, J. Glob. Optim..

[13]  Wen-Chiung Lee,et al.  Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine , 2003, Inf. Process. Lett..

[14]  Gerhard J. Woeginger,et al.  When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? , 2000, INFORMS J. Comput..

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

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

[17]  Gur Mosheiov,et al.  Scheduling jobs under simple linear deterioration , 1994, Comput. Oper. Res..

[18]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .