Skip to main content

Advertisement

SpringerLink
Log in

A comparison of local search algorithms with population-based algorithms in hybrid flow shop scheduling problems with realistic characteristics

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

Abstract

In this research, a bi-criteria group scheduling problem is investigated in a hybrid flow shop (HFS) environment, wherein the parallel machines are unrelated. The objective of the problem is to minimize a linear combination of the total weighted completion time being mindful of the producer and the total weighted tardiness being mindful of the customers. The underlying assumption is that the jobs are released into the system in dynamic times. The machine ready times are considered to be dynamic as well. Sequence-dependent setup times are required for changing the process between groups of jobs. The runtimes of jobs are assumed to be decreasing as the workers learn how to process similar jobs. A mixed-integer linear programing model is developed for the problem. However, since the problem is non-deterministic polynomial-time hard (NP-hard), it may not be solved to optimality within a reasonable time. This research comprehensively addresses the question of what type of meta-heuristic algorithm is more appropriate for solving these problems. In particular, local search algorithms are compared to the population-based algorithms with respect to the permutation or non-permutation properties of the optimal solution. Three algorithms based on tabu search as well as three algorithms based on simulated annealing are developed to represent the local search algorithms. Two other algorithms are developed based on genetic algorithm (GA) to exemplify the population-based algorithms. The results of a comprehensive experimental design reveal that GA-based algorithms have greater potential for identifying better quality solutions in HFS scheduling problems compared to the local search algorithms.

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. Neammanee P, Reodecha M (2009) A memetic algorithm-based heuristic for a scheduling problem in printed circuit board assembly. Comput Ind Eng 56(1):294–305

    Article  Google Scholar 

  2. Choi HS, Kim JS, Lee DH (2011) Real-time scheduling for reentrant hybrid flow shops: a decision tree based mechanism and its application to a TFT-LCD line. Expert Syst Appl 38(4):3514–3521

    Article  MathSciNet  Google Scholar 

  3. Vignier A, Billaut J-C, Proust C (1999) Les problèmes d’ordonnancement de type flow-shop hybride: état de l’art. RAI 33(02):117–183

    Article  MathSciNet  MATH  Google Scholar 

  4. Ruiz R, Vázquez-Rodríguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205(1):1–18

    Article  MATH  Google Scholar 

  5. Dessouky MM, Dessouky MI, Verma SK (1998) Flowshop scheduling with identical jobs and uniform parallel machines. Eur J Oper Res 109(3):620–631

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  7. Haouari M, Hidri L, Gharbi A (2006) Optimal scheduling of a two-stage hybrid flow shop. Math Meth Oper Res 64(1):107–124

    Article  MathSciNet  MATH  Google Scholar 

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

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Osman I, Potts C (1989) Simulated annealing for permutation flow-shop scheduling. Omega 17(6):551–557

    Article  Google Scholar 

  11. Ruiz R, Maroto C, Alcaraz J (2006) Two new robust genetic algorithms for the flowshop scheduling problem. Omega 34(5):461–476

    Article  Google Scholar 

  12. Ruiz R, Maroto C (2006) A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. Eur J Oper Res 169(3):781–800

    Article  MathSciNet  MATH  Google Scholar 

  13. Chen CL, Chen CL (2009) Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines. Comput Ind Eng 56(4):1393–1401

    Article  Google Scholar 

  14. Yaurima V, Burtseva L, Tchernykh A (2009) Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers. Comput Ind Eng 56(4):1452–1463

    Article  Google Scholar 

  15. Ruiz R, Şerifoğlu FS, Urlings T (2008) Modeling realistic hybrid flexible flowshop scheduling problems. Comput Oper Res 35(4):1151–1175

    Article  MATH  Google Scholar 

  16. Urlings T, Ruiz R, Stützle T (2010) Shifting representation search for hybrid flexible flowline problems. Eur J Oper Res 207(2):1086–1095

    Article  MATH  Google Scholar 

  17. Salmasi N, Logendran R, Skandari MR (2010) Total flow time minimization in a flowshop sequence-dependent group scheduling problem. Comput Oper Res 37(1):199–212

    Article  MathSciNet  MATH  Google Scholar 

  18. Zandieh M, Karimi N (2011) An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times. J Intell Manuf 22(6):979–989

    Article  Google Scholar 

  19. Behnamian J, Zandieh M, Ghomi SMTF (2010) Due windows group scheduling using an effective hybrid optimization approach. Int J Adv Manuf Technol 46(5–8):721–735

    Article  Google Scholar 

  20. Bozorgirad MA, Logendran R (2013) Bi-criteria group scheduling in hybrid flow shops. Int J Prod Econ 145(2):599–612

    Article  Google Scholar 

  21. İşler M, Toklu B and Çelik V (2011) Scheduling in a two-machine flow-shop for earliness/tardiness under learning effect. Int. J. Adv. Manuf. Technol, 1–9

  22. Chung YH, Tong LI (2012) Bi-criteria minimization for the permutation flowshop scheduling problem with machine-based learning effects. Comput Ind Eng 63(1):302–312

    Article  Google Scholar 

  23. Pargar F, and Zandieh M (2011) Bi-criteria SDST hybrid flow shop scheduling with learning effect of setup times: water flow-like algorithm approach. Int. J. Adv. Manuf. Technol, 1–15.

  24. IBM (2009) ILOG CPLEX Optimization Studio (Version 12.2). IBM

  25. Chen B, Potts CN, Woenginger GJ (1998) A review of machine scheduling: complexity, algorithms and approximability. In: Du DZ, Pardalos P (eds) Handbook of combinatorial optimization. Kluwer Academic Press, Boston, pp 21–169

    Google Scholar 

  26. Conway RW, Maxwell WL, and Miller LW (1971) Theory of scheduling. 1967. Addison-Wesley, Reading, Mass.[: 5] M. Eisenberg, Two queues with changeover times, Oper Res.(2), 19, 386–401

  27. Shaklevich N, Hoogeveen J, and Pinedo M (1996) Minimizing total weighted completion time in proportionate flow shop (Technical No. 9603). Eindhoven, The Netherlands: TU Eindhoven, Department of Mathematics and Computing

  28. Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13(5):533–549

    Article  MathSciNet  MATH  Google Scholar 

  29. Mehravaran Y, Logendran R (2012) Non-permutation flowshop scheduling in a supply chain with sequence-dependent setup times. Int J Prod Econ 135(2):953–963

    Article  Google Scholar 

  30. Haupt RL, Haupt SE (2004) Practical genetic algorithms, second edition., Retrieved from http://onlinelibrary.wiley.com/book/10.1002/0471671746

  31. DataFit (Version 9.0.59) (1995) Oakdale Engineering

  32. Montgomery DC (2008) Design and analysis of experiments. John Wiley & Sons

  33. Biskup D (2008) A state-of-the-art review on scheduling with learning effects. Eur J Oper Res 188(2):315–329

    Article  MathSciNet  MATH  Google Scholar 

  34. Schaller JE, Gupta JN, Vakharia AJ (2000) Scheduling a flowline manufacturing cell with sequence dependent family setup times. Eur J Oper Res 125(2):324–339

    Article  MATH  Google Scholar 

  35. Potts C, Van Wassenhove L (1982) A decomposition algorithm for the single machine total tardiness problem. Oper Res Lett 1(5):177–181

    Article  MATH  Google Scholar 

  36. Kim DW, Kim KH, Jang W, Frank Chen F (2002) Unrelated parallel machine scheduling with setup times using simulated annealing. Robot Comput Integr Manuf 18(3–4):223–231

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mechanical, Industrial, and Manufacturing Engineering, Oregon State University, Corvallis, OR, 97331-6001, USA

    Mir Abbas Bozorgirad & Rasaratnam Logendran

Authors
  1. Mir Abbas Bozorgirad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rasaratnam Logendran
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rasaratnam Logendran.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bozorgirad, M.A., Logendran, R. A comparison of local search algorithms with population-based algorithms in hybrid flow shop scheduling problems with realistic characteristics. Int J Adv Manuf Technol 83, 1135–1151 (2016). https://doi.org/10.1007/s00170-015-7650-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-015-7650-9

Keywords

Search

Navigation