Two-machine flow shop scheduling with deteriorating jobs and chain precedence constraints

In this paper we investigate two-machine flow shop scheduling problems with deteriorating jobs and chain precedence constraints. We consider two types of precedence constraints. Under the first type constraints, a successor cannot start on any machine before its predecessor has been completed on the same machine. Under the second one, a successor cannot start on any machine before its predecessor has been completed on all machines. We show that the problem with the first type precedence constraints is polynomially solvable, and the problem with the second type precedence constraints is NP-hard in the strong sense.

[1]  T.C.E. Cheng,et al.  Single-machine scheduling with deteriorating functions for job processing times , 2010 .

[2]  Ling Wang,et al.  On three-machine flow shop scheduling with deteriorating jobs , 2010 .

[3]  Vitaly A. Strusevich,et al.  Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints , 2004, J. Comb. Optim..

[4]  Chuanli Zhao,et al.  Scheduling deteriorating jobs under disruption , 2010 .

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

[6]  Stanislaw Gawiejnowicz,et al.  Time-Dependent Scheduling , 2008, Monographs in Theoretical Computer Science. An EATCS Series.

[7]  T.C.E. Cheng,et al.  Scheduling problems with deteriorating jobs and learning effects including proportional setup times , 2010, Comput. Ind. Eng..

[8]  T.C.E. Cheng,et al.  Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times , 2011 .

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

[10]  Wen-Chiung Lee,et al.  Scheduling with deteriorating jobs and past-sequence-dependent setup times , 2011 .

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

[12]  Shijie Sun,et al.  Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines , 2007, Eur. J. Oper. Res..

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

[14]  Adam Janiak,et al.  Sequencing with Ordered Criteria, Precedence and Group Technology Constraints , 2001, Informatica.

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

[16]  Tadashi Kurisu.  TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS , 1976 .

[17]  Wen-Chiung Lee,et al.  Single-machine group-scheduling problems with deteriorating setup times and job-processing times , 2008 .

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

[19]  Keiichiro Suenaga.  Vertical disintegration and catch-up in the semiconductor industry , 2010 .

[20]  Chin-Chia Wu,et al.  A two-machine flowshop scheduling problem with deteriorating jobs and blocking , 2010 .

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

[22]  C. T. Ng,et al.  Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine , 2011 .

[23]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .