Advertisement

A Novel Hybrid GA for the Assignment of Jobs to Machines in a Complex Hybrid Flow Shop Problem

  • Houda Harbaoui
  • Soulef Khalfallah
  • Odile Bellenguez-Morineau
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 736)

Abstract

This paper, investigates a complex manufacturing production system encountered in the food industry. We consider a two stage hybrid flow shop with two dedicated machines at stage1, and several identical parallel machines at stage 2. We consider two simultaneous constraints: the sequence dependent family setup times and time lags. The optimization criterion considered is the minimization of makespan. Given the complexity of problem, an hybrid genetic algorithms (HGA) based on an improving heuristic is presented. We experimented a new heuristic to assign jobs on the second stage. The proposed HGA is compared against a lower bound (LB), and against a mixed integer programming model (MIP). The results indicate that the proposed hybrid GA is effective and can produce near-optimal solutions in a reasonable amount of time.

Keywords

Hybrid flow shop Sequence dependent family setup Hybrid genetic algorithm Time lag New heuristic Dedicated machine 

References

  1. 1.
    Harbaoui, H., Bellenguez-Morineau, O., Khalfallah, S.: Scheduling a two-stage hybrid flow shop with dedicated machines, time lags and sequence-dependent family setup times. In: 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 002990–002995 (2016)Google Scholar
  2. 2.
    Gupta, J.N.D.: Two-stage hybrid flow shop scheduling problem. J. Oper. Res. Soc. 39, 359–364 (1988)CrossRefzbMATHGoogle Scholar
  3. 3.
    Chikhi, N., Benmansoury, R., Bekrarz, A., Hanafiy, A., Abbas, M.: Makespan minimization for two-stage hybrid flow shop with dedicated machines and additional constraints. In: 9th International Conference of Modeling, Optimization and Simulation - MOSIM 2012, 6–8 June 2012, Bordeaux, France (2012). https://hal.archives-ouvertes.fr/hal-00728687
  4. 4.
    Wang, S., Liu, M.: A heuristic method for two-stage hybrid flow shop with dedicated machines. Comput. Oper. Res. 40, 438–450 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Lin, B.M.T.: Two-stage flow shop scheduling with dedicated machines. Int. J. Prod. Res. 53(4), 1094–1097 (2015)CrossRefGoogle Scholar
  6. 6.
    Zandieh, M., Fatemi Ghomi, S.M.T., Moattar Husseini, S.M.: An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Appl. Math. Comput. 180, 111–127 (2006)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Kurz, M.E., Askin, R.G.: Scheduling flexible flow lines with sequence-dependent setup times. Eur. J. Oper. Res. 159, 66–82 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Ruiz, R., Maroto, C.: A genetic algorithm for hybrid flow shops with sequence dependent setup times and machine eligibility. Eur. J. Oper. Res. 169, 781–800 (2006)CrossRefzbMATHGoogle Scholar
  9. 9.
    Ruiz, R., Maroto, C., Alcaraz, J.: Solving the flow shop scheduling problem with sequence dependent setup times using advanced metaheuristics. Eur. J. Oper. Res. 165, 34–54 (2005)CrossRefzbMATHGoogle Scholar
  10. 10.
    Ebrahimi, M., Fatemi Ghomi, S.M.T., Karimi, B.: Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates. Appl. Math. Model. 38, 2490–2504 (2014)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Naderi, B., Ruiz, R., Zandieh, M.: A two stage flow shop with parallel dedicated machines. In: 8th International Conference of Modeling and Simulation, MOSIM 2010, Hammamet, Tunisia. IEEE Explore (2010)Google Scholar
  12. 12.
    Ziaeifar, A., Moghaddam, R.T., 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)CrossRefGoogle Scholar
  13. 13.
    Wang, S., Liu, M.: A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem. Comput. Oper. Res. 40, 1064–1075 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Huang, R.H., Yang, C.L., Huang, Y.C.: No-wait two-stage multi processor flowshop scheduling with unit setup. Int. J. Adv. Manuf. Technol. 44, 921–927 (2009)CrossRefGoogle Scholar
  15. 15.
    Sioud, A., Gravel, M., Gagné, M.: A genetic algorithm for solving a hybrid flexible flowshop with sequence dependent setup times. In: IEEE Congress on Evolutionary Computation, Cancan, Mexico. IEEE Explore (2013)Google Scholar
  16. 16.
    Pan, Q.-K., Gao, L., Li, X.-Y., Gao, K.-Z.: Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times. Appl. Math. Comput. 303, 89–112 (2017)MathSciNetGoogle Scholar
  17. 17.
    Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)Google Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Houda Harbaoui
    • 1
    • 3
  • Soulef Khalfallah
    • 2
  • Odile Bellenguez-Morineau
    • 3
  1. 1.Institut Supérieur d’Informatique et des Techniques de CommunicationUniversity of SousseHammam SousseTunisia
  2. 2.Institut Supérieur de Gestion de SousseUniversity of SousseSousseTunisia
  3. 3.Institut Mines Telecom Atlantique, LS2N, UMR CNRS 6004Nantes Cedex 3France

Personalised recommendations