Two-machine hybrid flowshop scheduling with identical jobs: Solution algorithms and analysis of hybrid benefits

Abstract We study two-machine hybrid flowshop scheduling with identical jobs. Each job consists of two tasks, namely a flexible task and a fixed task. The flexible task can be processed on either machine, while the fixed task must be processed on the second machine. The fixed task can only be processed after the flexible task is finished. Due to different technological capabilities of the two machines, the flexible task has different processing times on the two machines. Our goal is to find a schedule that minimises the makespan. We consider two variants of the problem, namely no buffer and infinite buffer capacity between the two machines. We present constant-time solution algorithms for both variants. In addition, analysing the relationship between the hybrid benefits and performance difference between the two machines, we find that, for the infinite-buffer case, increasing the technological level of the second machine does not necessarily increase the hybrid benefits.

[1]  Yun Shi,et al.  Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility , 2018, J. Comb. Optim..

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

[3]  Chris N. Potts,et al.  Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan , 2004, Ann. Oper. Res..

[4]  Hakan Gultekin,et al.  Scheduling in flowshops with flexible operations: Throughput optimization and benefits of flexibility , 2012 .

[5]  Bertrand M. T. Lin,et al.  Two-stage flexible flow shop scheduling subject to fixed job sequences , 2016, J. Oper. Res. Soc..

[6]  L. Tang,et al.  Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers , 2006, J. Oper. Res. Soc..

[7]  Eugeniusz Nowicki,et al.  The permutation flow shop with buffers: A tabu search approach , 1999, Eur. J. Oper. Res..

[8]  Qi Wei,et al.  Approximation Algorithms for a Two-Stage Hybrid Flow Shop: Approximation Algorithms for a Two-Stage Hybrid Flow Shop , 2012 .

[9]  Yves Crama,et al.  Throughput optimization in two-machine flowshops with flexible operations , 2010, J. Sched..

[10]  Feifeng Zheng,et al.  Robust scheduling of a two-stage hybrid flow shop with uncertain interval processing times , 2016 .

[11]  Erfang Shan,et al.  A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs , 2014, Theor. Comput. Sci..

[12]  John W. Fowler,et al.  A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines , 2018, J. Sched..

[13]  George L. Vairaktarakis,et al.  Flowshops with processing flexibility across production stages , 1998 .

[14]  G. M. Komaki,et al.  Minimising makespan in the two-stage assembly hybrid flow shop scheduling problem using artificial immune systems , 2016 .

[15]  Oya Ekin Karasan,et al.  Robot move sequence determining and multiple part-type scheduling in hybrid flexible flow shop robotic cells , 2016, Comput. Ind. Eng..

[16]  Tadeusz Sawik,et al.  A scheduling algorithm for flexible flow lines with limited intermediate buffers , 1993 .

[17]  George L. Vairaktarakis,et al.  Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility , 2004 .

[18]  Hannu Ahonen,et al.  Scheduling flexible flow shop with recirculation and machine sequence-dependent processing times: formulation and solution procedures , 2017 .

[19]  Javad Rezaeian,et al.  Two meta-heuristic algorithms for flexible flow shop scheduling problem with robotic transportation and release time , 2016, Appl. Soft Comput..

[20]  H. Yong,et al.  A two-stage semi-hybrid flowshop problem in graphics processing , 2005 .