Elitist Ant System for the Distributed Job Shop Scheduling Problem

  • Imen Chaouch
  • Olfa Belkahla Driss
  • Khaled Ghedira
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10350)

Abstract

In this paper, we are interested in industrial plants geographically distributed and more precisely the Distributed Job shop Scheduling Problem (DJSP) in multi-factory environment. The problem consists of finding an effective way to assign jobs to factories then, to generate a good operation schedule. To do this, a bio-inspired algorithm is applied, namely the Elitist Ant System (EAS) aiming to minimize the makespan. Several numerical experiments are conducted to evaluate the performance of our algorithm applied to the Distributed Job shop Scheduling Problem and the results show the shortcoming of the Elitist Ant System compared to developed algorithms in the literature.

Keywords

Elitist Ant System Job shop Makespan Multi-factory Scheduling 
This is a preview of subscription content, log in to check access.

References

  1. 1.
    Bonabeau, E., Dorigo, M., Theraulaz, G.: Swarm Intelligence: from Natural to Artificial Systems, vol. 1. Oxford University Press, New York (1999)MATHGoogle Scholar
  2. 2.
    Chung, S.H., Lau, H.C., Ho, G.T., Ip, W.: Optimization of system reliability in multi-factory production networks by maintenance approach. Expert Syst. Appl. 36(6), 10188–10196 (2009)CrossRefGoogle Scholar
  3. 3.
    Dorigo, M.: Optimization, learning and natural algorithms. Ph.D. thesis, Politecnico di Milano, Italy (1992)Google Scholar
  4. 4.
    Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 26(1), 29–41 (1996)CrossRefGoogle Scholar
  5. 5.
    Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117–129 (1976)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Jia, H., Fuh, J.Y., Nee, A.Y., Zhang, Y.: Web-based multi-functional scheduling system for a distributed manufacturing environment. Concurrent Eng. 10(1), 27–39 (2002)CrossRefGoogle Scholar
  7. 7.
    Jia, H., Fuh, J.Y., Nee, A.Y., Zhang, Y.: Integration of genetic algorithm and gantt chart for job shop scheduling in distributed manufacturing systems. Comput. Ind. Eng. 53(2), 313–320 (2007)CrossRefGoogle Scholar
  8. 8.
    Jia, H., Nee, A.Y., Fuh, J.Y., Zhang, Y.: A modified genetic algorithm for distributed scheduling problems. J. Intell. Manufact. 14(3–4), 351–362 (2003)CrossRefGoogle Scholar
  9. 9.
    Naderi, B., Azab, A.: Modeling and heuristics for scheduling of distributed job shops. Expert Syst. Appl. 41(17), 7754–7763 (2014)CrossRefGoogle Scholar
  10. 10.
    Naderi, B., Azab, A.: An improved model and novel simulated annealing for distributed job shop problems. Int. J. Adv. Manufact. Technol. 81, 1–11 (2015)CrossRefGoogle Scholar
  11. 11.
    Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278–285 (1993)CrossRefMATHGoogle Scholar
  12. 12.
    Talbi, E.G.: Metaheuristics: from Design to Implementation, vol. 74. Wiley, New York (2009)CrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Imen Chaouch
    • 1
    • 2
  • Olfa Belkahla Driss
    • 1
    • 3
  • Khaled Ghedira
    • 1
    • 4
  1. 1.COSMOS LaboratoryUniversité de la ManoubaManoubaTunisia
  2. 2.Ecole Nationale des Sciences de l’InformatiqueUniversité de la ManoubaManoubaTunisia
  3. 3.Ecole Supérieure de Commerce de TunisUniversité de la ManoubaManoubaTunisia
  4. 4.Institut Supérieur de Gestion de TunisUniversité de TunisTunisTunisia

Personalised recommendations