Skip to main content
SpringerLink
Log in

Lot splitting scheduling procedure for makespan reduction and machine capacity increase in a hybrid flow shop with batch production

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

Abstract

The general definition of the hybrid flow shop (HFS) environment is a set of S ≥ 2 production stages where at least one of these stages includes more than one machine, which can process one job at a time. A job can be defined as several operations to be performed by none, one, or more machines at each stage. Usually, these jobs are completed in some sequence between the different production stages, and in the case of setup activities, products are grouped in batches with buffers of work in progress between different production stages. Today, flexible production systems permit in some instances to relax job precedence constrains with alternative process cycles and to group together different batches of similar products in order to reduce setup activity incidence. On the other hand, the availability of multiple parallel machines in a single production stage makes it possible to split the lot size between different resources. This paper aims to solve the HFS scheduling problem in a flexible multistage batch production system, offering a heuristic procedure, to minimize the production makespan and increase the productive capacity utilization using a batch aggregation/splitting strategy while introducing the “workload leveling function” concept. The results are compared with other important scheduling rules widely accepted in the industry and made part of an industrial application. The company used as a test sample is an Italian rotor shaft manufacturer. The final result is illustrated to validate the proposed heuristics.

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. Alaykyran K, Engin O, Doyen A (2007) Using ant colony optimization to solve hybrid flow shop scheduling problems. Int J Advanced Manuf Technol 35(5–6):541–550

    Article  Google Scholar 

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

    Article  Google Scholar 

  3. Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187(3):985–1032

    Article  MathSciNet  MATH  Google Scholar 

  4. Battini D, Faccio M, Persona A, Sgarbossa F (2008) Balancing–sequencing procedure for a mixed model assembly system in case of finite buffer capacity. Int J Adv Manuf Technol 44:345–359

    Article  Google Scholar 

  5. Bolat A, Al-Harkan I, Al-Harbi B (2005) Flow-shop scheduling for three serialstations with the last two duplicate. Comput Oper Res 32(3):647–667

    Article  MathSciNet  MATH  Google Scholar 

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

  7. Bratley P, Florian M, Robillard P (1975) Scheduling with earliest start and due date constraints on multiple machines. Naval Res Logist Quearterly 22(1):165–173

    Article  MATH  Google Scholar 

  8. Chen L, Bostel N, Dejax P, Cai JC, Xi LF (2007) A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. Eur J Oper Res 181(1):40–58

    Article  MathSciNet  MATH  Google Scholar 

  9. Das RS, Canel C (2005) An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing system. Int J Prod Econ 97:247–262

    Article  Google Scholar 

  10. Guirchoun S, Martineau P, Billaut JC (2005) Total completion time minimization in a computer system with a server and two parallel processors. Comput Oper Res 32(3):599–611

    Article  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

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Huang YM, Shiau DF (2008) Combined column generation and constructiveheuristic for a proportionate flexible flow shop scheduling. Int J Adv Manuf Technol 38(7–8):691–704

    Article  Google Scholar 

  14. Johnson SM (1954) Optimal two-and three-stage production schedules with set up times included. Naval Res Logist Quarterly 1:61–68

    Article  Google Scholar 

  15. Jungwattanakit J, Reodecha M, Chaovalitwongse P, Werner F (2008) Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Int J Adv Manuf Technol 37(3–4):354–370

    Article  Google Scholar 

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

  17. Kadipasaoglu SN, Xiang W, Khumawala BM (1997) A comparison of sequencing rules in static and dynamic hybrid flow systems. Int J Prod Res 35(5):1359–1384

    Article  MATH  Google Scholar 

  18. Kim JS, Kang SH, Lee SM (1997) Transfer batch scheduling for a two-stage flowshop with identical parallel machines at each stage. Omega Int J Manag Sci 25(5):547–555

    Article  Google Scholar 

  19. Kurz ME, Askin RG (2004) Scheduling flexible flow lines with sequence-dependent setup times. Eur J Oper Res 159(1):66–82

    Article  MathSciNet  MATH  Google Scholar 

  20. Lee GC (2009) Estimating order lead times in hybrid flowshops with different scheduling rules. Comput Ind Eng 56(4):1668–1674

    Article  Google Scholar 

  21. Li SL (1997) A hybrid two-stage flow shop with part family, batch production, major and minor set-ups. Eur J Oper Res 102(1):142–156

    Article  MATH  Google Scholar 

  22. Lin BMT, Jeng AAK (2004) Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs. Int J Prod Econ 91:121–134

    Article  Google Scholar 

  23. Liu Y, Karimi IA (2008) Scheduling multistage batch plants with parallel units and no interstage storage. Comput Chem Eng 32(4–5):671–693

    Article  Google Scholar 

  24. Logendran R, De Szoeke P, Barnard F (2006) Sequence-dependent group scheduling problems in flexible flow shops. Int J Prod Econ 102(1):66–86

    Article  Google Scholar 

  25. Logendran R, Carson S, Hanson E (2005) Group scheduling in flexible flow shops. Int J Prod Econ 96(2):143–155

    Article  Google Scholar 

  26. Naderi B, Zandieh M, Roshanaei VV (2009) Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness. Int J Adv Manuf Technol 41(11–12):1186–1198

    Article  Google Scholar 

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

  28. Roshanaei V, Naderi B, Jolai F, Khalili M (2009) A variable neighborhood search for job shop scheduling with set-up times to minimize makespan. Futur Gener Comput Syst 25:654–661

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

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

    Article  MATH  Google Scholar 

  32. Sawik T (2006) Hierarchical approach to production scheduling in make-to-order assembly. Int J Prod Res 44(4):801–830

    Article  MATH  Google Scholar 

  33. Sawik T (2007) A lexicographic approach to bi-objective scheduling of single-period orders in make-to-order manufacturing. Eur J Oper Res 180(3):1060–1075

    Article  MathSciNet  MATH  Google Scholar 

  34. Vinod V, Sridharan R (2008) Scheduling a dynamic job shop production system with sequence-dependent setups: an experimental study. Robot Comput-Integr Manuf 24:435–449

    Article  Google Scholar 

  35. Voss S, Witt A (2007) Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: a real-world application. Int J Prod Econ 105(2):445–458

    Article  Google Scholar 

  36. Xuan H, Tang LX (2007) Scheduling a hybrid flowshop with batch production at the last stage. Comput Oper Res 34(9):2718–2733

    Article  MATH  Google Scholar 

  37. Yang T, Kuo Y, Cho C (2007) A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem. Eur J Oper Res 176(3):1859–1873

    Article  MATH  Google Scholar 

  38. Yang T, Kuo Y, Chang I (2004) Tabu-search simulation optimization approach for flow-shop scheduling with multiple processors—a case study. Int J Prod Res 42(19):4015–4030

    Article  MATH  Google Scholar 

  39. Zhang W, Yin CY, Liu JY, Linn RJ (2005) Multi-job lot streaming to minimize the mean completion time in m − 1 hybrid flow shops. Int J Prod Econ 96(2):189–200

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management and Engineering, University of Padua, Stradella San Nicola, 3 36100, Vicenza, Italy

    Anna Azzi & Alessandro Persona

  2. Department of Innovation in Mechanics and Management, University of Padua, Via Venezia 1, 35131, Padua, Italy

    Maurizio Faccio & Fabio Sgarbossa

Authors
  1. Anna Azzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maurizio Faccio
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alessandro Persona
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Fabio Sgarbossa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maurizio Faccio.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Azzi, A., Faccio, M., Persona, A. et al. Lot splitting scheduling procedure for makespan reduction and machine capacity increase in a hybrid flow shop with batch production. Int J Adv Manuf Technol 59, 775–786 (2012). https://doi.org/10.1007/s00170-011-3525-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-011-3525-x

Keywords

Search

Navigation