Skip to main content

Advertisement

SpringerLink
Log in

Solving a new mathematical model for a hybrid flow shop scheduling problem with a processor assignment by a genetic algorithm

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

Abstract

This paper presents a new mathematical model for a hybrid flow shop scheduling problem with a processor assignment that minimizes makespan (i.e., C max) and cost of assigning a number of processors to stages. In this problem, it is assumed that there are a number of parallel identical processors which are assigned to all of the stages with an unlimited intermediate storage between any two successive stages. To solve such a hard problem, first a new heuristic algorithm is proposed to compute the makespan that is embedded in the proposed genetic algorithm in order to find the best sequence of jobs, and then processors are assigned to the stages simultaneously. A number of test problems have been solved and related results are illustrated and analyzed.

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. Vignier A, Billaut JC, Proust C (1999) Hybrid flowshop scheduling problems: state of the art. Rairo-OR 33(2):117–183

    Article  MathSciNet  MATH  Google Scholar 

  2. Andres C, Albarracin JM, Tormo G, Vicens E, Garcia-Sabater JP (2005) Group technology in a hybrid flowshop environment: a case study. Eur J Oper Res 167(1):272–281

    Article  MathSciNet  MATH  Google Scholar 

  3. Guinet AGP (1991) Textile production systems: a succession of non-identical parallel processor shops. J Oper Res Soc 42(8):655–671

    MATH  Google Scholar 

  4. Janiak A, Kozan E, Lichtenstein M, Oguz C (2007) Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion. Int J Prod Econ 105(2):407–424

    Article  Google Scholar 

  5. Alaykýran K, Engin O, Döyen A (2007) Using ant colony optimization to solve hybrid flow shop scheduling problems. Int J Adv Manuf Technol 35:541–550

    Article  Google Scholar 

  6. Rashidi E, Jahandar M, Zandieh M (2010) An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines. Int J Adv Manuf Technol 49:1129–1139

    Article  Google Scholar 

  7. Shiau D and Huang Y (2011) A hybrid two-phase encoding particle swarm optimization for total weighted completion time minimization in proportionate flexible flow shop scheduling. Int J Adv Manuf Technol. doi:10.1007/s00170-011-3378-3

  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. Santos DL, Hunsucker JL, Deal DE (1995) Flow multi permutation sequences for flow shops with multiple processors. J Inf Optim Sci 16(2):351–366

    MATH  Google Scholar 

  10. Santos DL, Hunsucker JL, Deal DE (1995) Global lower bounds for flow shops with multiple processors. Eur J Oper Res 80(1):112–120

    Article  MATH  Google Scholar 

  11. Guinet AGP, 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 

  12. Sawik TJ (2000) Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers. Math Comput Model 31(13):39–52

    Article  MathSciNet  MATH  Google Scholar 

  13. Sawik TJ (2002) An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. Math Comput Model 36(4–5):461–471

    Article  MathSciNet  MATH  Google Scholar 

  14. Kurz ME, Askin RG (2003) Comparing scheduling rules for flexible flow lines. Int J Prod Econ 85(3):371–388

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  16. Paternina-Arboleda C, Montoya-Torres J, Acero-Dominguez M, Herrera-Hernandez M (2008) Scheduling jobs on a k-stage flexible flow-shop. Ann Oper Res 164(1):29–40

    Article  MathSciNet  MATH  Google Scholar 

  17. Jungwattanakit J, Reodecha M, Chaovalitwongse P, Werner F (2009) A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Comput Oper Res 36(2):358–378

    Article  MathSciNet  MATH  Google Scholar 

  18. Tavakkoli-Moghaddam R, Safaei N, Sassani F (2009) A memetic algorithm for the flexible flow line scheduling problem with processor blocking. Comput Oper Res 36(2):402–414

    Article  MathSciNet  MATH  Google Scholar 

  19. Cao D, Chen M, Wan G (2005) Parallel machine selection and job scheduling to minimize machine cost and job tardiness. Comput Oper Res 32:1995–2012

    Article  MATH  Google Scholar 

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

    Article  Google Scholar 

  21. Kis T, Pesch E (2005) A review of exact solution methods for the non-preemptive multiprocessor flowshop problem. Eur J Oper Res 164(3):592–608

    Article  MathSciNet  MATH  Google Scholar 

  22. Ruiz R, Vazquez-Rodriguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205:1–18

    Article  MathSciNet  MATH  Google Scholar 

  23. Ribas I, Leisten R, Framinan JM (2010) Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput Oper Res 37:1439–1454

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  25. Guo ZX, Wong WK, Leung SYS, Fan JT, Chan SF (2008) A genetic-algorithm-based optimization model for scheduling flexible assembly lines. Int J Adv Manuf Technol 36:156–158

    Article  Google Scholar 

  26. Bertel S, Billaut JC (2004) A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. Eur J Oper Res 159(3):651–662

    Article  MathSciNet  MATH  Google Scholar 

  27. Jolai F, Sheikh S, Rabbani M, Karimi B (2009) A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection. Int J Adv Manuf Technol 42:523–532

    Article  Google Scholar 

  28. Oguz C, Ercan M (2005) A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks. J Sched 8(4):323–351

    Article  MathSciNet  MATH  Google Scholar 

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

  30. Wanga L, Zhang L, Zheng DZ (2006) An effective hybrid genetic algorithm for flow shop scheduling with limited buffers. Comput Oper Res 33:2960–2971

    Article  MathSciNet  Google Scholar 

  31. Shiau DF, Cheng SC, Huang YM (2008) Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm. Expert Syst Appl 34(2):1133–1143

    Article  Google Scholar 

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

Download references

Author information

Authors and Affiliations

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

    Amin Ziaeifar & Reza Tavakkoli-Moghaddam

  2. Department of Industrial Engineering, University of Tafresh, Tafresh, Iran

    Khosro Pichka

Authors
  1. Amin Ziaeifar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Reza Tavakkoli-Moghaddam
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Khosro Pichka
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Reza Tavakkoli-Moghaddam.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ziaeifar, A., Tavakkoli-Moghaddam, R. & Pichka, K. Solving a new mathematical model for a hybrid flow shop scheduling problem with a processor assignment by a genetic algorithm. Int J Adv Manuf Technol 61, 339–349 (2012). https://doi.org/10.1007/s00170-011-3701-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-011-3701-z

Keywords

Search

Navigation