Abstract
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.
Similar content being viewed by others
References
Lev V, Adiri I (1984) V-shop scheduling. Eur J Oper Res 18:51–56
Wang MY, Sethi SP, van de Velde SL (1997) Minimizing makespan in a class of reentrant shops. Oper Res 45:702–712
Kubiak W, Lou SXC, Wang YM (1996) Mean flow time minimization reentrant job shops with a hub. Oper Res 44:764–776
Steiner G, Xue ZH (2006) On the connection between a cyclic job shop and a reentrant flow shop scheduling problem. J Sched 9:381–387
Chen JS, Pan JCH, Wu CK (2007) Minimizing makespan in reentrant flow-shops using hybrid tabu search. Int J Adv Manuf Technol 34:353–361
Chen JS, Pan JCH, Wu CK (2008) Hybrid tabu search for re-entrant permutation flow-shop scheduling problem. Expert Syst Appl 34:1924–1930
Choi SW, Kim YD (2008) Minimizing makespan on an m-machine re-entrant flowshop. Comput Oper Res 35:1684–1696
Chu F, Chu CB, Desprez C (2010) Series production in a basic re-entrant shop to minimize makespan or total flow time. Comput Ind Eng 58:257–268
Chen JS (2006) A branch and bound procedure for the reentrant permutation flow-shop scheduling problem. Int J Adv Manuf Technol 29:1186–1193
Hwang H, Sun JU (1997) Production sequencing problem with reentrant work flows and sequence dependent setup times. Comput Ind Eng 33:773–776
Pan JCH, Chen JS (2005) Mixed binary integer programming formulations for the reentrant job shop scheduling problem. Comput Oper Res 32:1197–1212
Topaloglu S, Kilincli G (2009) A modified shifting bottleneck heuristic for the reentrant job shop scheduling problem with makespan minimization. Int J Adv Manuf Technol 44:781–794
Choi HS, Kim HW, Lee DH, Yoon J, Yun CY, Chae KB (2009) Scheduling algorithms for two-stage reentrant hybrid flow shops: minimizing makespan under the maximum allowable due dates. Int J Adv Manuf Technol 42:963–973
Choi SW, Kim YD (2009) Minimizing total tardiness on a two-machine re-entrant flowshop. Eur J Oper Res 199:375–384
Jing CX, Tang GC, Qian XS (2008) Heuristic algorithms for two machine re-entrant flow shop. Theo Comput Sci 400:137–143
Demirkol E, Uzsoy R (2000) Decomposition methods for reentrant flow shops with sequence-dependent setup times. J Sched 3:155–177
Monch L, Drießel R (2005) A distributed shifting bottleneck heuristic for complex job shops. Comput Ind Eng 49:363–380
Kang YH, Kim SS, Shin HJ (2007) A scheduling algorithm for the reentrant shop: an application in semiconductor manufacture. Int J Adv Manuf Technol 35:566–574
Graves SC, Meal HC, Stefek D, Zeghmi AH (1983) Scheduling of reentrant flow shops. J Oper Manag 3:197–207
Glassey CR, Resende GC (1988) Closed-loop job release control for VLSI circuit manufacturing. IEEE Trans Semi Manu 1:36–46
Lozinski C, Glassey CR (1988) Bottleneck starvation indicators for shop floor control. IEEE Trans Semi Manu 1:147–153
Wein LM (1988) Scheduling semiconductor wafer fabrication. IEEE Trans Semi Manu 1:115–129
Lou SXC, Kager PW (1989) A robust production control policy for VLSI wafer fabrication. IEEE Trans Semi Manu 2:159–164
Lou SXC, Yan H, Sethi S, Grardel A, Deosthali P (1990) Hub-centered production control of wafer fabrication. In: The Proceedings of 1990 IEEE/SEMI Advanced Semiconductor Manufacturing Conference and Workshop. Danvers, 11–12 Sept 1990, pp. 27–32
Lane DE, Sidney JB (1993) Batching and scheduling in FMS hubs: flow time considerations. Oper Res 41:1091–1103
Chen JC, Chen KH, Wu JJ, Chen CW (2008) A study of the flexible job shop scheduling problem with parallel machines and reentrant process. Int J Adv Manuf Technol 39:344–354
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, CA
Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117–129
Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Nav Res Logist 1:61–68
Drobouchevitch IG, Strusevich VA (1999) A heuristic algorithm for two-machine re-entrant shop scheduling. Ann Oper Res 86:417–439
Langston MA (1987) Interstage transportation planning in the deterministic flow-shop environment. Oper Res 35:556–564
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Xie, X., Tang, L. & Li, Y. Scheduling of a hub reentrant job shop to minimize makespan. Int J Adv Manuf Technol 56, 743–753 (2011). https://doi.org/10.1007/s00170-011-3204-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-011-3204-y