A two-machine flowshop makespan scheduling problem with deteriorating jobs

In traditional scheduling problems, the job processing times are assumed to be known and fixed from the first job to be processed to the last job to be completed. However, in many realistic situations, a job will consume more time than it would have consumed if it had begun earlier. This phenomenon is known as deteriorating jobs. In the science literature, the deteriorating job scheduling problems are relatively unexplored in the flowshop settings. In this paper, we study a two-machine flowshop makespan scheduling problem in which job processing times vary as time passes, i.e. they are assumed as increasing functions of their starting times. First, an exact algorithm is established to solve most of the problems of up to 32 jobs in a reasonable amount of time. Then, three heuristic algorithms are provided to derive the near-optimal solutions. A simulation study is conducted to evaluate the performances of the proposed algorithms. In addition, the impact of the deterioration rate is also investigated.

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

[2]  Adam Janiak,et al.  Minimizing maximum lateness under linear deterioration , 2000, Eur. J. Oper. Res..

[3]  T. C. Edwin Cheng,et al.  Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine , 2003, Comput. Oper. Res..

[4]  Gur Mosheiov,et al.  Scheduling jobs with step-deterioration; minimizing makespan on a single- and multi-machine , 1995 .

[5]  P. S. Sundararaghavan,et al.  Single machine scheduling with start time dependent processing times: Some solvable cases , 1994 .

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

[7]  Adam Janiak,et al.  Job Sequencing with Exponential Functions of Processing Times , 2006, Informatica.

[8]  T. C. Edwin Cheng,et al.  Single machine scheduling with step-deteriorating processing times , 2001, Eur. J. Oper. Res..

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

[10]  Li-Yan Wang,et al.  Single machine group scheduling under decreasing linear deterioration , 2007 .

[11]  S. S. Panwalkar,et al.  Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem , 1982, Oper. Res..

[12]  Adam Janiak,et al.  Minimizing the total weighted completion time of deteriorating jobs , 2002, Inf. Process. Lett..

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

[14]  T. C. Edwin Cheng,et al.  Two-stage flowshop earliness and tardiness machine scheduling involving a common due window , 2004 .

[15]  Gur Mosheiov,et al.  Λ-Shaped Policies to Schedule Deteriorating Jobs , 1996 .

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

[17]  Adam Janiak,et al.  Scheduling in a contaminated area: A model and polynomial algorithms , 2006, Eur. J. Oper. Res..

[18]  T. C. Edwin Cheng,et al.  The Complexity of Scheduling Starting Time Dependent Tasks with Release Times , 1998, Inf. Process. Lett..

[19]  T. C. Edwin Cheng,et al.  Three scheduling problems with deteriorating jobs to minimize the total completion time , 2002, Inf. Process. Lett..

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

[21]  J.-B. Wang,et al.  Flow shop scheduling problems with deteriorating jobs under dominating machines , 2006, J. Oper. Res. Soc..

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

[23]  Feng Chu,et al.  A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness , 2006, Appl. Math. Comput..

[24]  Ji-Bo Wang,et al.  Flow shop scheduling with deteriorating jobs under dominating machines , 2006 .

[25]  T.C.E. Cheng,et al.  Scheduling start time dependent jobs to minimize the total weighted completion time , 2002, J. Oper. Res. Soc..

[26]  T. C. Edwin Cheng,et al.  Minimizing total completion time in a two-machine flow shop with deteriorating jobs , 2006, Appl. Math. Comput..

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

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