Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence

Abstract This paper addresses scheduling n jobs in a two-machine flow shop to minimize the total completion time, subject to the condition that the jobs are processed in the same given sequence on both machines. A new concept of optimal schedule block is introduced, and polynomial time dynamic programming algorithms employing this concept are derived for two specific problems. In the first problem, the machine-2 processing time of a job is a step increasing function of its waiting time between the machines, and a decision about machine-1 idle time insertion has to be made. This problem is solved in O ( n 2 )  time. In the second problem, the jobs are processed in batches and each batch is preceded by a machine-dependent setup time. An O ( n 5 ) algorithm is developed to find an optimal batching decision.

[1]  Bertrand M. T. Lin,et al.  Two-machine flowshop scheduling with conditional deteriorating second operations , 2006, Int. Trans. Oper. Res..

[2]  Bertrand M. T. Lin,et al.  Scheduling in an assembly-type production chain with batch transfer , 2007 .

[3]  B. Lina,et al.  Scheduling in an assembly-type production chain with batch transfer , 2006 .

[4]  Wlodzimierz Szwarc,et al.  Optimal timing schedules in earliness-tardiness single machine sequencing , 1995 .

[5]  Francis Sourd,et al.  Optimal timing of a sequence of tasks with general completion costs , 2005, Eur. J. Oper. Res..

[6]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[7]  Roberto da Costa Quinino,et al.  An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions , 2005, Comput. Oper. Res..

[8]  Chris N. Potts,et al.  Batching decisions for assembly production systems , 2004, Eur. J. Oper. Res..

[9]  Vitaly A. Strusevich,et al.  The open shop scheduling problem with a given sequence of jobs on one machine , 1998 .

[10]  Bertrand M. T. Lin,et al.  Two-stage assembly-type flowshop batch scheduling problem subject to a fixed job sequence , 2012, J. Oper. Res. Soc..

[11]  Bertrand M. T. Lin,et al.  Makespan minimization in the two‐machine flowshop batch scheduling problem , 2000 .

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

[13]  T. C. Edwin Cheng,et al.  Scheduling the fabrication and assembly of components in a two-machine flowshop , 1999 .

[14]  Federico Della Croce,et al.  Optimal idle time insertion in early-tardy parallel machines scheduling with precedence constraints , 2002 .

[15]  Francis Sourd,et al.  An improved earliness-tardiness timing algorithm , 2007, Comput. Oper. Res..

[16]  C. T. Ng,et al.  Batching and scheduling in a multi-machine flow shop , 2007, J. Sched..

[17]  Chris N. Potts,et al.  Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops , 2001, INFORMS J. Comput..

[18]  Bertrand M. T. Lin,et al.  Scheduling with centralized and decentralized batching policies in concurrent open shops , 2011 .

[19]  Joanna Józefowska,et al.  Minimizing the earliness-tardiness costs on a single machine , 2006, Comput. Oper. Res..

[20]  V. Sridharan,et al.  Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review , 2000, Oper. Res..

[21]  Leyuan Shi,et al.  Dual constrained single machine sequencing to minimize total weighted completion time , 2005, IEEE Transactions on Automation Science and Engineering.

[22]  John J. Kanet,et al.  Single-machine scheduling with early and tardy completion costs , 1993 .

[23]  Robert E. Tarjan,et al.  One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties , 1988, Math. Oper. Res..