Scheduling in aerospace composite manufacturing systems: a two-stage hybrid flow shop problem

  • Aria Azami
  • Kudret Demirli
  • Nadia Bhuiyan


This research investigates a real-world complex two-stage hybrid flow shop scheduling problem which is faced during the manufacturing of composite aerospace components. There are a number of new constraints to be taken into account in this special hybrid flow shop, in particular limited physical capacity of the intermediate buffer, limited waiting time between processing stages, and limited tools/molds used in both stages in each production cycle. We propose a discrete-time mixed integer linear programming model with an underlying branch and bound algorithm, to solve small- and medium-size problems (up to 100 jobs). To solve the large instances of the problem (up to 300 jobs), a genetic algorithm with a novel crossover operator is developed. A new heuristic method is introduced to generate the initial population of the genetic algorithm. The results show the high level of computational efficiency and accuracy of the proposed genetic algorithm when compared to the optimal solutions obtained from the mathematical model. The results also show that the proposed genetic algorithm outperforms the conventional dispatching rules (i.e., shortest processing time, earliest dues date and longest processing time) when applied to large-size problems. A real case study undertaken at one of the leading aerospace companies in Canada is used to formulate the model, collect data for the parameters of the model, and analyze the results.


Job scheduling Hybrid flow shop Mixed integer linear programming Genetic algorithm Aerospace composite manufacturing systems 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


Funding information

This research is partially supported by funds from NSERC/CRIAQ project CRDPJ 459185 – 13.


  1. 1.
    Rose-Anderssen C, Baldwin JS, Ridgway K, Allen PM, Varga L (2008) Aerospace supply chains as evolutionary networks of activities: innovation via risk-sharing partnerships. Creativity Innov Manag 17(4):304–318CrossRefGoogle Scholar
  2. 2.
    Lubin, G. (2013). Handbook of composites. Springer Science & Business Media.Google Scholar
  3. 3.
    Pinedo, M. (2012). Scheduling. New York: Springer.Google Scholar
  4. 4.
    Ruiz R, Vázquez-Rodríguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205(1):1–18MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Ribas I, Leisten R, Framiñan JM (2010) Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comp Oper Res 37(8):1439–1454MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Potts CN, Kovalyov MY (2000) Scheduling with batching: a review. Eur J Oper Res 120(2):228–249MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Mathirajan M, Sivakumar AI (2006) A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor. Int J Adv Manuf Technol 29(9–10):990–1001CrossRefGoogle Scholar
  8. 8.
    Ebrahimi M, Ghomi SF, Karimi B (2014) Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates. Appl Math Model 38(9):2490–2504MathSciNetCrossRefGoogle Scholar
  9. 9.
    Shahvari O, Logendran R (2016) Hybrid flow shop batching and scheduling with a bi-criteria objective. Int J Prod Econ 179:239–258CrossRefGoogle Scholar
  10. 10.
    Yimer AD, Demirli K (2009) Fuzzy scheduling of job orders in a two-stage flow-shop with batch-processing machines. Int J Approx Reason 50(1):117–137CrossRefzbMATHGoogle Scholar
  11. 11.
    Tang L, Liu P (2009) Minimizing make-span in a two-machine flow-shop scheduling with batching and release time. Math Comp Model 49(5):1071–1077CrossRefzbMATHGoogle Scholar
  12. 12.
    Shen L, Buscher U (2012) Solving the serial batching problem in job shop manufacturing systems. Eur J Oper Res 221(1):14–26MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Ahmadi JH, Ahmadi RH, Dasu S, Tang CS (1992) Batching and scheduling jobs on batch and discrete processors. Oper Res 40(4):750–763MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Yurtsever, T., Kutanoglu, E., & Johns, J. (2009, December). Heuristic based scheduling system for diffusion in semiconductor manufacturing. In Winter Simulation Conference (pp. 1677–1685). Winter Simulation Conference.Google Scholar
  15. 15.
    Hoogeveen H, van de Velde S (1998) Scheduling by positional completion times: analysis of a two-stage flow shop problem with a batching machine. Math Program 82(1–2):273–289MathSciNetzbMATHGoogle Scholar
  16. 16.
    Brucker P, Gladky A, Hoogeveen H, Kovalyov MY, Potts C, Tautenhahn T, Van De Velde S (1998) Scheduling a batching machine. J Sch 1:31–54MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Balasubramanian H, Mönch L, Fowler J, Pfund M (2004) Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness. Int J Prod Res 42(8):1621–1638CrossRefzbMATHGoogle Scholar
  18. 18.
    Reichelt D, Mönch L (2006) Multi-objective scheduling of jobs with incompatible families on parallel batch machines. In: Evolutionary computation in combinatorial optimization. Springer, Berlin Heidelberg, pp 209–221CrossRefGoogle Scholar
  19. 19.
    Luo H, Huang GQ, Feng Zhang Y, Yun Dai Q (2011) Hybrid flow-shop scheduling with batch-discrete processors and machine maintenance in time windows. Int J Prod Res 49(6):1575–1603CrossRefGoogle Scholar
  20. 20.
    Qin, W., Zhang, J., & Song, D. (2015). An improved ant colony algorithm for dynamic hybrid flow shop scheduling with uncertain processing time. Journal of Intelligent Manufacturing, 1–14.Google Scholar
  21. 21.
    Amin-Naseri MR, Beheshti-Nia MA (2009) Hybrid flow shop scheduling with parallel batching. Int J Prod Econ 117(1):185–196CrossRefGoogle Scholar
  22. 22.
    Rossi A, Pandolfi A, Lanzetta M (2014) Dynamic set-up rules for hybrid flow shop scheduling with parallel batching machines. Int J Prod Res 52(13):3842–3857CrossRefGoogle Scholar
  23. 23.
    Fattahi P, Hosseini SMH, Jolai F, Tavakkoli-Moghaddam R (2014) A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations. Appl Math Model 38(1):119–134MathSciNetCrossRefGoogle Scholar
  24. 24.
    Wang S, Liu M, Chu C (2015) A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling. Int J Prod Res 53(4):1143–1167CrossRefGoogle Scholar
  25. 25.
    Feng X, Zheng F, Xu Y (2016) Robust scheduling of a two-stage hybrid flow shop with uncertain interval processing times. Int J Prod Res 54(12):3706–3717CrossRefGoogle Scholar
  26. 26.
    Sun, H., & Chung, T. P. (2016, December). Two-stage hybrid flow-shop scheduling problem with waiting time. In Industrial Engineering and Engineering Management (IEEM), 2016 IEEE International Conference on (pp. 442–446).Google Scholar
  27. 27.
    Tan Y, Mönch L, Fowler JW (2017) A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines. J Sch:1–18Google Scholar
  28. 28.
    Sawik T (2002) An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. Math Comp Model 36(4):461–471MathSciNetCrossRefzbMATHGoogle Scholar
  29. 29.
    Gicquel C, Hege L, Minoux M, Van Canneyt W (2012) A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints. Comp Oper Res 39(3):629–636MathSciNetCrossRefzbMATHGoogle Scholar
  30. 30.
    Attar SF, Mohammadi M, Tavakkoli-Moghaddam R (2013) Hybrid flexible flowshop scheduling problem with unrelated parallel machines and limited waiting times. Int J Adv Manuf Technol 68(5–8):1583–1599CrossRefGoogle Scholar
  31. 31.
    Chung, T. P., Sun, H., & Liao, C. J. (2016). Two new approaches for a two-stage hybrid flow-shop problem with a single batch processing machine under waiting time constraint. Computers & Industrial Engineering.Google Scholar
  32. 32.
    Wang X, Tang L (2009) A tabu search heuristic for the hybrid flow-shop scheduling with finite intermediate buffers. Comp Oper Res 36(3):907–918CrossRefzbMATHGoogle Scholar
  33. 33.
    Tang LX, Xuan H (2006) Lagrangian relaxation algorithms for real-time hybrid flow-shop scheduling with finite intermediate buffers. J Oper Res Soc 57(3):316–324CrossRefzbMATHGoogle Scholar
  34. 34.
    Leisten R (1990) Flow-shop sequencing problems with limited buffer storage. The. Int J Prod Res 28(11):2085–2100CrossRefzbMATHGoogle Scholar
  35. 35.
    Agnetis A, Pacciarelli D, Rossi F (1997) Batch scheduling in a two-machine flow shop with limited buffer. Discret Appl Math 72(3):243–260MathSciNetCrossRefzbMATHGoogle Scholar
  36. 36.
    Pranzo M (2004) Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times. Eur J Oper Res 153(3):581–592MathSciNetCrossRefzbMATHGoogle Scholar
  37. 37.
    Yaurima V, Burtseva L, Tchernykh A (2009) Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers. Comp Ind Eng 56(4):1452–1463CrossRefGoogle Scholar
  38. 38.
    Holland, J. H. (1975). Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. U Michigan Press.Google Scholar
  39. 39.
    Oĝuz C, Ercan MF (2005) A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks. J Sch 8(4):323–351MathSciNetCrossRefzbMATHGoogle Scholar
  40. 40.
    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(1–2):156–168CrossRefGoogle Scholar
  41. 41.
    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–662MathSciNetCrossRefzbMATHGoogle Scholar
  42. 42.
    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(5–6):523–532CrossRefGoogle Scholar
  43. 43.
    Shiau DF, Cheng SC, Huang YM (2008) Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm. Expert Syst Appl 34(2):1133–1143CrossRefGoogle Scholar
  44. 44.
    Zandieh M, Mozaffari E, Gholami M (2010) A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems. J Intell Manuf 21(6):731–743CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Ltd., part of Springer Nature 2017

Authors and Affiliations

  1. 1.Department of Mechanical and Industrial EngineeringConcordia UniversityQuebecCanada
  2. 2.Department of Industrial and Systems EngineeringKhalifa UniversityAbu DhabiUAE

Personalised recommendations