Skip to main content

Advertisement

SpringerLink
Log in

Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria

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

Abstract

In textile industries, production facilities are established as multi-stage production flow shop facilities, where a production stage may be made up of parallel machines. This known as a flexible or hybrid flow shop environment. This paper considers the problem of scheduling n independent jobs in such an environment. In addition, we also consider the general case in which parallel machines at each stage may be unrelated. Each job is processed in ordered operations on a machine at each stage. Its release date and due date are given. The preemption of jobs is not permitted. We consider both sequence- and machine-dependent setup times. The problem is to determine a schedule that minimizes a convex combination of makespan and the number of tardy jobs. A 0–1 mixed integer program of the problem is formulated. Since this problem is NP-hard in the strong sense, we develop heuristic algorithms to solve it approximately. Firstly, several basic dispatching rules and well-known constructive heuristics for flow shop makespan scheduling problems are generalized to the problem under consideration. We sketch how, from a job sequence, a complete schedule for the flexible flow shop problem with unrelated parallel machines can be constructed. To improve the solutions, polynomial heuristic improvement methods based on shift moves of jobs are applied. Then, genetic algorithms are suggested. We discuss the components of these algorithms and test their parameters. The performance of the heuristics is compared relative to each other on a set of test problems with up to 50 jobs and 20 stages.

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. Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York

    Google Scholar 

  2. Gupta JND, Krüger K, Lauff V, Werner F, Sotskov YN (2002) Heuristics for hybrid flow shops with controllable processing times and assignable due dates. Comput Oper Res 29(10):1417–1439

    Article  MATH  Google Scholar 

  3. Alisantoso D, Khoo LP, Jiang PY (2003) An immune algorithm approach to the scheduling of a flexible PCB flow shop. Int J Adv Manuf Tech 22(11–12):819–827

    Article  Google Scholar 

  4. Lin H-T, Liao C-J (2003) A case study in a two-stage hybrid flow shop with setup time and dedicated machines. Int J Prod Econ 86(2):133–143

    Article  Google Scholar 

  5. Wang W, Hunsucker JL (2003) An evaluation of the CDS heuristic in flow shops with multiple processors. J Chinese Inst Ind Eng 20(3):295–304

    Google Scholar 

  6. Linn R, Zhang W (1999) Hybrid flow shop scheduling: a survey. Comput Ind Eng 37(1–2):57–61

    Article  Google Scholar 

  7. Wang H (2005) Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions. Expert Syst 22(2):78–85

    Article  MATH  Google Scholar 

  8. Arthanari TS, Ramamurthy KG (1971) An extension of two machines sequencing problem. Opsearch 8(1):10–22

    MathSciNet  Google Scholar 

  9. Salvador MS (1973) A solution to a special case of flow shop scheduling problems. In: Elmaghraby SE (ed) Symposium of the theory of scheduling and applications. Springer, New York Berlin Heidelberg, pp 83–91

    Google Scholar 

  10. Brah SA, Hunsucker JL (1991) Branch and bound algorithm for the flow shop with multiple processors. Eur J Oper Res 51(1):88–99

    Article  MATH  Google Scholar 

  11. Portmann M-C, Vignier A, Dardilhac D, Dezalay D (1998) Branch and bound crossed with GA to solve hybrid flowshops. Eur J Oper Res 107(2):389–400

    Article  MATH  Google Scholar 

  12. Moursli O, Pochet Y (2000) A branch-and-bound algorithm for the hybrid flowshop. Int J Prod Econ 64(1–3):113–125

    Article  Google Scholar 

  13. Gupta JND (1988) Two-stage, hybrid flowshop scheduling problem. J Oper Res Soc 39(4):359–364

    Article  MATH  Google Scholar 

  14. Sriskandarajah C, Sethi SP (1989) Scheduling algorithms for flexible flowshops: worst and average case performance. Eur J Oper Res 43(2):143–160

    Article  MATH  MathSciNet  Google Scholar 

  15. Guinet A, Solomon MM, Kedia PK, Dussauchoy A (1996) A computational study of heuristics for two-stage flexible flowshops. Int J Prod Res 34(5):1399–1415

    Article  MATH  Google Scholar 

  16. Gupta JND, Tunc EA (1994) Scheduling a two-stage hybrid flowshop with separable setup and removal times. Eur J Oper Res 77(3):415–428

    Article  MATH  Google Scholar 

  17. Santos DL, Hunsucker JL, Deal DE (1996) An evaluation of sequencing heuristics in flow shops with multiple processors. Comput Ind Eng 30(4):681–691

    Article  Google Scholar 

  18. Jones DF, Mirrazavi SK, Tamiz M (2002) Multi-objective meta-heuristics: an overview of the current state-of-art. Eur J Oper Res 137(1):1–9

    Article  MATH  Google Scholar 

  19. Reeves CR (1995) A genetic algorithm for flowshop sequencing. Comput Oper Res 22(1):5–13

    Article  MATH  Google Scholar 

  20. Cheng RW, Gen MS, Tozawa T (1995) Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms. Comput Ind Eng 29(1–4):513–517

    Article  Google Scholar 

  21. Ruiz R, Maroto C, Alcaraz J (2005) Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. Eur J Oper Res 165(1):34–54

    Article  MATH  MathSciNet  Google Scholar 

  22. Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2006) A survey of scheduling problems with setup times or cost. Eur J Oper Res (in press) DOI 10.1016/j.ejor.2006.06.60

  23. Jungwattanakit J, Reodecha M, Chaovalitwongse P, Werner F (2006) Sequencing heuristics for flexible flow shop scheduling problems with unrelated parallel machines and setup times. In: Proceedings of the 2006 IE Network National Conference, Bangkok, Thailand, December 2006, session F53, pp 1–8

  24. Palmer DS (1965) Sequencing jobs through a multi-stage process in the minimum total time—a quick method of obtaining a near optimum. Oper Res Q 16(1):101–107

    MathSciNet  Google Scholar 

  25. Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n job, m machine sequencing problem. Manag Sci 16(10):630–637

    Google Scholar 

  26. Gupta JND (1971) A functional heuristic algorithm for the flowshop scheduling problem. Oper Res Q 22(1):39–47

    Article  MATH  Google Scholar 

  27. Dannenbring DG (1977) An evaluation of flow shop sequencing heuristics. Manag Sci 23(11):1174–1182

    Article  MATH  Google Scholar 

  28. Nawaz M, Enscore E Jr, Ham I (1983) A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA Int J Manag Sci 11(1):91–95

    Article  Google Scholar 

  29. Pinedo M, Chao X (1999) Operations scheduling with applications in manufacturing and services. Irwin/McGraw-Hill, Boston, Massachusetts

    MATH  Google Scholar 

  30. Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan, Ann Arbor, Michigan

    Google Scholar 

  31. Werner F (1984) On the solution of special sequencing problems. PhD thesis, TU Magdeburg, Germany

  32. Rajendran C, Ziegler H (2003) Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times. Eur J Oper Res 149(3):513–522

    Article  MATH  MathSciNet  Google Scholar 

  33. Guinet A, Echalier F, Dussauchoy A (1992) Scheduling jobs on parallel machines: a survey. In: Proceedings of the EURO XII/TIMS XXXI Joint International Conference, Helsinki, Finland, June 1992

  34. Framinan JM, Gupta JND, Leisten R (2004) A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J Oper Res Soc 55(12):1243–1255

    Article  MATH  Google Scholar 

  35. Ruiz R, Maroto C (2005) A comprehensive review and evaluation of permutation flowshop heuristics. Eur J Oper Res 165(2):479–494

    Article  MATH  MathSciNet  Google Scholar 

  36. Jungwattanakit J, Reodecha M, Chaovalitwongse P, Werner F (2006) Constructive and simulated annealing heuristics for hybrid flow shops with unrelated parallel machines. In: Proceedings of the 3rd OR-CRN Operations Research Conference, Bangkok, Thailand, August/September 2006, pp 110–121

  37. Jungwattanakit J, Reodecha M, Chaovalitwongse P, Werner F (2006) Sequencing and tabu search heuristics for hybrid flow shops with unrelated parallel machines and setup times. In: Proceedings of the 7th Asian Pacific Industrial Engineering and Management Systems Conference and the 9th Asia Pacific Regional Meeting of International Foundation for Production Research, Bangkok, Thailand, December 2006, pp 1330–1342

  38. Grabowski J, Wodecki M (2004) A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput Oper Res 31(11):1891–1909

    Article  MATH  MathSciNet  Google Scholar 

  39. Wang L, Zheng D-Z (2003) An effective hybrid heuristic for flow shop scheduling. Int J Adv Manuf Technol 21(1):38–44

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Faculty of Engineering, Chulalongkorn University, Bangkok, 10330, Thailand

    Jitti Jungwattanakit, Manop Reodecha & Paveena Chaovalitwongse

  2. Faculty of Mathematics, Otto-von-Guericke University Magdeburg, P.O. Box 4120, 39016, Magdeburg, Germany

    Frank Werner

Authors
  1. Jitti Jungwattanakit
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manop Reodecha
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paveena Chaovalitwongse
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Frank Werner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Frank Werner.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jungwattanakit, J., Reodecha, M., Chaovalitwongse, P. et al. Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Int J Adv Manuf Technol 37, 354–370 (2008). https://doi.org/10.1007/s00170-007-0977-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-007-0977-0

Keywords

Search

Navigation