Skip to main content
SpringerLink
Log in

Two-stage flow-shop scheduling problem with non-identical second stage assembly machines

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

Abstract

This paper addresses the two-stage assembly flow-shop problem (TSAFP) with multiple non-identical assembly machines in second stage with the objective function of makespan minimization. This problem is a generalization of previously proposed problems in TSAFP. Mathematical mixed-integer linear programming model of this problem is defined, and for it being NP-hard, a hybrid SA heuristic is proposed. The heuristic is proved to solve the problem in reduced time with negligible error. To validate the proposed method, a real-life example is presented and solved in which the efficiency of the proposed heuristic is shown.

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. Lee CY, Cheng TCE, Lin BMT (1993) Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Manag Sci 39(5):616–625. doi:10.1287/mnsc.39.5.616

    Article  MATH  Google Scholar 

  2. Potts CN, Sevast’janov SV, Strusevich VA, Van Wassenhove LN, Zwaneveld CM (1995) The two-stage assembly scheduling problem: complexity and approximation. J Oper Res 43(2):346–355

    Article  MATH  Google Scholar 

  3. Allahverdi A, Al-Anzi FS (2006) A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application. Comput Oper Res 33:1056–1080. doi:10.1016/j.cor.2004.09.002

    Article  MATH  Google Scholar 

  4. Lin BMT, Cheng TCE, Chou ASC (2007) Scheduling in an assembly-type production chain with batch transfer. Omega 35:143–151. doi:10.1016/j.omega.2005.04.004

    Article  Google Scholar 

  5. Zhang Y, Zhou Z, Liu J (2010) The production scheduling problem in a multi-page invoice printing system. Comput Oper Res 37:1814–1821. doi:10.1016/j.cor.2010.01.014

    Article  MATH  Google Scholar 

  6. Mirsanei HS, Karimi B, Jolai F (2009) Flow shop scheduling with two batch processing machines and nonidentical job sizes. Int J Adv Manuf Technol 45:553–572. doi:10.1007/s00170-009-1986-y

    Article  Google Scholar 

  7. Oguz C, Fikret Ercan M, Edwin Cheng TC, Fung YF (2003) Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. Eur J Oper Res 149:390–403. doi:10.1016/S0377-2217(02)00766-X

    Article  MATH  Google Scholar 

  8. Sung CS, Juhn J (2009) Makespan minimization for a 2-stage assembly scheduling problem subject to component available time constraint. Int J Prod Econ 119:392–401. doi:10.1016/j.ijpe.2009.03.012

    Article  Google Scholar 

  9. Allaoui H, Artiba A (2006) Scheduling two-stage hybrid flow shop with availability constraints. Comput Oper Res 33:1399–1419. doi:10.1016/j.cor.2004.09.034

    Article  MathSciNet  MATH  Google Scholar 

  10. Koulamas C, Kyparisis GJ (2001) The three-stage assembly flowshop scheduling problem. Comput Oper Res 28:689–704. doi:10.1016/S0305-0548(00)00004-6

    Article  MathSciNet  MATH  Google Scholar 

  11. Gupta JND, Hariri AMA, Potts CN (1997) Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. Ann Oper Res 69:171–191. doi:10.1023/A:1018976827443

    Article  MATH  Google Scholar 

  12. Gupta JND, Hennig K, Werner F (2002) Local search heuristics for two-stage flow shop problems with secondary criterion. Comput Oper Res 29:123–149. doi:10.1016/S0305-0548(00)00061-7

    Article  MATH  Google Scholar 

  13. Torabzadeh E, Zandieh M (2010) Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop. Adv Eng Softw 41:1238–1243. doi:10.1016/j.advengsoft.2010.06.004

    Article  MATH  Google Scholar 

  14. Al-Anzi FS, Allahverdi A (2009) Heuristics for a two-stage assembly flow shop with bicriteria of maximum lateness and makespan. Comput Oper Res 36:2682–2689. doi:10.1016/j.cor.2008.11.018

    Article  MathSciNet  MATH  Google Scholar 

  15. Allahverdi A, Al-Anzi FS (2007) The two-stage assembly flow shop scheduling problem with bicriteria of makespan and mean completion time. Int J Adv Manuf Technol 37:166–177. doi:10.1007/s00170-007-0950-y

    Article  Google Scholar 

  16. Hatami S, Ebrahimnejad S, Tavakkoli-Moghaddam R, Maboudian Y (2010) Two meta-heuristics for three-stage assembly flowshop scheduling with sequence-dependent setup times. Int J Adv Manuf Technol 50:1153–1164. doi:10.1007/s00170-010-2579-5

    Article  Google Scholar 

  17. Tozkapan A, Kirca O, Chung CS (2003) A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem. Comput Oper Res 30:309–320. doi:10.1016/S0305-0548(01)00098-3

    Article  MathSciNet  MATH  Google Scholar 

  18. Choi HS, Lee DH (2009) Scheduling algorithms to minimize the number of tardy jobs in two-stage hybrid flow shops. Comput Ind Eng 56:113–120. doi:10.1016/j.cie.2008.04.005

    Article  MathSciNet  Google Scholar 

  19. Hariri AMA, Potts CN (1997) A branch and bound algorithm for the two-stage assembly scheduling problem. Eur J Oper Res 103:547–556. doi:10.1016/S0377-2217(96)00312-8

    Article  MATH  Google Scholar 

  20. 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. doi:10.1007/s00170-008-1656-5

    Article  Google Scholar 

  21. Neppalli VR, Chen CL, Gupta JND (1996) Genetic algorithms for the two-stage bicriteria flowshop problem. Eur J Oper Res 95(2):356–373. doi:10.1016/0377-2217(95)002

    Article  MATH  Google Scholar 

  22. Kyparisis GJ, Koulamas C (2006) A note on makespan minimization in two-stage flexible flow shops with uniform machines. Eur J Oper Res 175:1321–1327. doi:10.1016/j.ejor.2005.06.017

    Article  MATH  Google Scholar 

  23. He D, Babayan A, Kusiak A (2001) Scheduling manufacturing systems in an agile environment. Robot Comput Integr Manuf 17:87–97. doi:10.1016/S0736-5845(00)00041-7

    Article  Google Scholar 

  24. Allahverdi A, Al-Anzi FS (2009) The two-stage assembly scheduling problem to minimize total completion time with setup times. Comput Oper Res 36:2740–2747. doi:10.1016/j.cor.2008.12.001

    Article  MathSciNet  MATH  Google Scholar 

  25. Javadian N, Mozdgir A, Gazani Koohi E, Davallo Qajar MR, Shiraqai ME (2009) Solving assembly flowshop scheduling problem with parallel machines using variable neighborhood search. Proceedings of 39th International Conference of Computers and Industrial Engineering, July 2009, University of Technology of Troyes, Paris, France. doi: 10.1109/ICCIE.2009.5223845

Download references

Author information

Authors and Affiliations

  1. Intelligent Manufacturing Systems (IMS) Centre, University of Windsor, Windsor, Ontario, Canada

    J. Navaei

  2. Department of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran

    J. Navaei, S. M. T. Fatemi Ghomi & H. Hidaji

  3. Department of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran

    F. Jolai

  4. Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran

    M. E. Shiraqai

Authors
  1. J. Navaei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. M. T. Fatemi Ghomi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. F. Jolai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. E. Shiraqai
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. H. Hidaji
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to S. M. T. Fatemi Ghomi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Navaei, J., Ghomi, S.M.T.F., Jolai, F. et al. Two-stage flow-shop scheduling problem with non-identical second stage assembly machines. Int J Adv Manuf Technol 69, 2215–2226 (2013). https://doi.org/10.1007/s00170-013-5187-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-013-5187-3

Keywords

Search

Navigation