Scheduling of a hub reentrant job shop to minimize makespan

This paper focuses on a hub reentrant shop scheduling problem which is motivated by actual packing production line in the iron and steel industry. There are five operations for processing a job where three operations must be processed on a hub machine, and between any two consecutive operations on the hub machine, two operations must be processed on other two secondary machines, respectively. We mainly consider two types of the problem. The first is basic hub reentrant shop (BHRS) problem where only one machine in each secondary machine center. The second is hybrid hub reentrant shop (HHRS) problem where multiple machines in each secondary machine center. The objective is to minimize the makespan. For BHRS problem, we show that the problem is NP-hard in the strong sense. Some properties are derived for identifying an optimal schedule. Furthermore, a heuristic algorithm is proposed with the worst performance ratio 6:5, and this ratio is demonstrated tight. For HHRS problem, two well-solvable cases are proposed, respectively. Under a split condition, HHRS is equivalent to a two-stage hybrid flow shop problem. The worst case of a class of proposed algorithms is analyzed. The performance ratio is demonstrated relatively with the secondary machine numbers.

[1]  Yeong-Dae Kim,et al.  Minimizing total tardiness on a two-machine re-entrant flowshop , 2009, Eur. J. Oper. Res..

[2]  Hark Hwang,et al.  Production sequencing problem with reentrant work flows and sequence dependent setup times , 1997 .

[3]  Wieslaw Kubiak,et al.  Mean Flow Time Minimization in Reentrant Job Shops with a Hub , 1996, Oper. Res..

[4]  Feng Chu,et al.  Series production in a basic re-entrant shop to minimize makespan or total flow time , 2010, Comput. Ind. Eng..

[5]  I. Adiri,et al.  V-shop scheduling , 1984 .

[6]  Guochun Tang,et al.  Heuristic algorithms for two machine re-entrant flow shop , 2008, Theor. Comput. Sci..

[7]  M. Y. Wang,et al.  Minimizing Makespan in a Class of Reentrant Shops , 1997, Oper. Res..

[8]  C. R. Glassey,et al.  Bottleneck starvation indicators for shop floor control (semiconductor manufacturing process) , 1988 .

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

[10]  Jeffrey B. Sidney,et al.  Batching and Scheduling in FMS Hubs: Flow Time Considerations , 1993, Oper. Res..

[11]  V. A. Strusevich,et al.  A heuristic algorithm for two‐machine re‐entrant shop scheduling , 1999, Ann. Oper. Res..

[12]  Jen-Shiang Chen,et al.  Minimizing makespan in reentrant flow-shops using hybrid tabu search , 2007 .

[13]  Lawrence M. Wein,et al.  Scheduling semiconductor wafer fabrication , 1988 .

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

[15]  Seyda Topaloglu,et al.  A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization , 2009 .

[16]  Jen-Shiang Chen,et al.  Mixed binary integer programming formulations for the reentrant job shop scheduling problem , 2005, Comput. Oper. Res..

[17]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[18]  Michael A. Langston,et al.  Interstage Transportation Planning in the Deterministic Flow-Shop Environment , 1987, Oper. Res..

[19]  Lars Mönch,et al.  A distributed shifting bottleneck heuristic for complex job shops , 2005, Comput. Ind. Eng..

[20]  Hyun Joon Shin,et al.  A scheduling algorithm for the reentrant shop: an application in semiconductor manufacture , 2007 .

[21]  Yeong-Dae Kim,et al.  Minimizing makespan on an m-machine re-entrant flowshop , 2008, Comput. Oper. Res..

[22]  Dong-Ho Lee,et al.  Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due dates , 2009 .

[23]  Reha Uzsoy,et al.  Decomposition methods for reentrant flow shops with sequence‐dependent setup times , 2000 .

[24]  Stephen C. Graves,et al.  Scheduling of re-entrant flow shops , 1983 .

[25]  Houmin Yan,et al.  Hub-centered production control of wafer fabrication , 1990, IEEE/SEMI Conference on Advanced Semiconductor Manufacturing Workshop.

[26]  George Steiner,et al.  On the connection between a cyclic job shop and a reentrant flow shop scheduling problem , 2006, J. Sched..

[27]  S.X.C. Lou,et al.  A robust production control policy for VLSI wafer fabrication , 1989 .

[28]  Jen-Shiang Chen,et al.  A branch and bound procedure for the reentrant permutation flow-shop scheduling problem , 2006 .

[29]  C. Roger Glassey,et al.  Bottleneck Starvation Indicators for Shop Floor Control , 1988 .

[30]  James C. Chen,et al.  A study of the flexible job shop scheduling problem with parallel machines and reentrant process , 2008 .

[31]  Jen-Shiang Chen,et al.  Hybrid tabu search for re-entrant permutation flow-shop scheduling problem , 2008, Expert Syst. Appl..

[32]  Mauricio G. C. Resende,et al.  Closed-loop job release control for VLSI circuit manufacturing , 1988 .