Two-stage flexible flow shop scheduling subject to fixed job sequences

This paper investigates the scheduling problem in a two-stage flexible flow shop, which consists of m stage-1 parallel dedicated machines and a stage-2 bottleneck machine, subject to the condition that nl jobs per type l∈{1, …, m} are processed in a fixed sequence. Four regular performance metrics, including the total completion time, the maximum lateness, the total tardiness, and the number of tardy jobs, are considered. For each considered objective function, we aim to determine an optimal interleaving processing sequence of all jobs coupled with their starting times on the stage-2 bottleneck machine. The problem under study is proved to be strongly NP-hard. An O(m2Πl=1mnl2) dynamic programming algorithm coupled with numerical experiments is presented.

[1]  F. J. Hwang,et al.  Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence , 2014, Ann. Oper. Res..

[2]  Jaehwan Yang.  A two-stage hybrid flow shop with dedicated machines at the first stage , 2013, Comput. Oper. Res..

[3]  Hatem Hadda,et al.  On the two-stage hybrid flow shop with dedicated machines , 2015, RAIRO Oper. Res..

[4]  Shijie Sun,et al.  A Hybrid Two-Stage flowshop Scheduling Problem , 2007, Asia Pac. J. Oper. Res..

[5]  Bertrand M. T. Lin,et al.  Total completion time minimization in a 2-stage differentiation flowshop with fixed sequences per job type , 2011, Inf. Process. Lett..

[6]  Joseph Y.-T. Leung.  Open Shop Scheduling , 2004 .

[7]  Bertrand M. T. Lin.  The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine , 1999, Comput. Oper. Res..

[8]  Gur Mosheiov,et al.  Comments on "Flow shop and open shop scheduling with a critical machine and two operations per job" , 2004, Eur. J. Oper. Res..

[9]  Uwe Fink,et al.  Planning And Scheduling In Manufacturing And Services , 2016 .

[10]  Christos Koulamas,et al.  Flow shop and open shop scheduling with a critical machine and two operations per job , 2000, Eur. J. Oper. Res..

[11]  Gur Mosheiov,et al.  Minimum weighted number of tardy jobs on an m-machine flow-shop with a critical machine , 2010, Eur. J. Oper. Res..

[12]  Bertrand M. T. Lin,et al.  Batch scheduling in differentiation flow shops for makespan minimisation , 2013 .

[13]  Bertrand M. T. Lin,et al.  Two-stage flowshop scheduling with a common second-stage machine , 1997, Comput. Oper. Res..

[14]  Gur Mosheiov,et al.  A two-stage flow shop scheduling with a critical machine and batch availability , 2012 .

[15]  Lifeng Xi,et al.  A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal , 2007, Eur. J. Oper. Res..

[16]  Gur Mosheiov,et al.  Batch Scheduling In A Two-Stage Flexible Flow Shop Problem , 2014 .

[17]  Marco Garetti,et al.  Book review , 2006 .

[18]  Bertrand M. T. Lin.  Two-stage flow shop scheduling with dedicated machines , 2015 .

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

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

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

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