Skip to main content
SpringerLink
Log in

Scheduling of a hub reentrant job shop to minimize makespan

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Lev V, Adiri I (1984) V-shop scheduling. Eur J Oper Res 18:51–56

    Article  MathSciNet  MATH  Google Scholar 

  2. Wang MY, Sethi SP, van de Velde SL (1997) Minimizing makespan in a class of reentrant shops. Oper Res 45:702–712

    Article  MATH  Google Scholar 

  3. Kubiak W, Lou SXC, Wang YM (1996) Mean flow time minimization reentrant job shops with a hub. Oper Res 44:764–776

    Article  MATH  Google Scholar 

  4. 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

    Article  MathSciNet  MATH  Google Scholar 

  5. 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

    Article  Google Scholar 

  6. Chen JS, Pan JCH, Wu CK (2008) Hybrid tabu search for re-entrant permutation flow-shop scheduling problem. Expert Syst Appl 34:1924–1930

    Article  Google Scholar 

  7. Choi SW, Kim YD (2008) Minimizing makespan on an m-machine re-entrant flowshop. Comput Oper Res 35:1684–1696

    Article  MathSciNet  MATH  Google Scholar 

  8. 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

    Article  Google Scholar 

  9. Chen JS (2006) A branch and bound procedure for the reentrant permutation flow-shop scheduling problem. Int J Adv Manuf Technol 29:1186–1193

    Article  Google Scholar 

  10. Hwang H, Sun JU (1997) Production sequencing problem with reentrant work flows and sequence dependent setup times. Comput Ind Eng 33:773–776

    Article  Google Scholar 

  11. Pan JCH, Chen JS (2005) Mixed binary integer programming formulations for the reentrant job shop scheduling problem. Comput Oper Res 32:1197–1212

    MathSciNet  MATH  Google Scholar 

  12. 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

    Article  Google Scholar 

  13. 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

    Article  Google Scholar 

  14. Choi SW, Kim YD (2009) Minimizing total tardiness on a two-machine re-entrant flowshop. Eur J Oper Res 199:375–384

    Article  MathSciNet  MATH  Google Scholar 

  15. Jing CX, Tang GC, Qian XS (2008) Heuristic algorithms for two machine re-entrant flow shop. Theo Comput Sci 400:137–143

    Article  MathSciNet  MATH  Google Scholar 

  16. Demirkol E, Uzsoy R (2000) Decomposition methods for reentrant flow shops with sequence-dependent setup times. J Sched 3:155–177

    Article  MathSciNet  MATH  Google Scholar 

  17. Monch L, Drießel R (2005) A distributed shifting bottleneck heuristic for complex job shops. Comput Ind Eng 49:363–380

    Article  Google Scholar 

  18. 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

    Article  Google Scholar 

  19. Graves SC, Meal HC, Stefek D, Zeghmi AH (1983) Scheduling of reentrant flow shops. J Oper Manag 3:197–207

    Article  Google Scholar 

  20. Glassey CR, Resende GC (1988) Closed-loop job release control for VLSI circuit manufacturing. IEEE Trans Semi Manu 1:36–46

    Article  Google Scholar 

  21. Lozinski C, Glassey CR (1988) Bottleneck starvation indicators for shop floor control. IEEE Trans Semi Manu 1:147–153

    Article  Google Scholar 

  22. Wein LM (1988) Scheduling semiconductor wafer fabrication. IEEE Trans Semi Manu 1:115–129

    Article  Google Scholar 

  23. Lou SXC, Kager PW (1989) A robust production control policy for VLSI wafer fabrication. IEEE Trans Semi Manu 2:159–164

    Article  Google Scholar 

  24. 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

  25. Lane DE, Sidney JB (1993) Batching and scheduling in FMS hubs: flow time considerations. Oper Res 41:1091–1103

    Article  MATH  Google Scholar 

  26. 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

    Article  Google Scholar 

  27. Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, CA

    MATH  Google Scholar 

  28. Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117–129

    Article  MathSciNet  MATH  Google Scholar 

  29. Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Nav Res Logist 1:61–68

    Article  Google Scholar 

  30. Drobouchevitch IG, Strusevich VA (1999) A heuristic algorithm for two-machine re-entrant shop scheduling. Ann Oper Res 86:417–439

    Article  MathSciNet  MATH  Google Scholar 

  31. Langston MA (1987) Interstage transportation planning in the deterministic flow-shop environment. Oper Res 35:556–564

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Key Laboratory of Manufacturing Industrial and Integrated Automation, Shenyang University, Shenyang, Liaoning, 110044, People’s Republic of China

    Xie Xie & Yanping Li

  2. Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics Institute, Northeastern University, Shenyang, 110004, People’s Republic of China

    Lixin Tang

Authors
  1. Xie Xie
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lixin Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yanping Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xie Xie.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-011-3204-y

Keywords

Search

Navigation