Skip to main content
SpringerLink
Log in

A Greedy Biogeography-Based Optimization Algorithm for Job Shop Scheduling Problem with Time Lags

  • Conference paper
  • First Online:
International Joint Conference SOCO’18-CISIS’18-ICEUTE’18 (SOCO’18-CISIS’18-ICEUTE’18 2018)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 771))

Abstract

This paper deals with the Job shop Scheduling problem with Time Lags (JSTL). JSTL is an extension of the job shop scheduling problem, where minimum and maximum time lags are introduced between successive operations of the same job. We propose a combination between Biogeography-Based Optimization (BBO) algorithm and Greedy heuristic for solving the JSTL problem with makespan minimization. Biogeography-Based optimization is an evolutionary algorithm which is inspired by the migration of species between habitats. BBO has successfully solved optimization problems in many different domains and has reached a relatively mature state using two main steps: migration and mutation. Good performances of the proposed combination between Greedy and BBO algorithms are shown through different comparisons on benchmarks of Fisher and Thompson, Lawrence and Carlier for JSTL problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Afsar, H.M., Lacomme, P., Ren, L., Prodhon, C., Vigo, D.: Resolution of a job-shop problem with transportation constraints, a master/slave approach. In: IFAC Conference on Manufacturing Modelling, Management and Control (2016)

    Article  Google Scholar 

  2. Artigues, C., Huguet, M., Lopez, P.: Generalized disjunctive constraint propagation for solving the job shop problem with time lags. Eng. Appl. Artif. Intell. 24, 220–231 (2011)

    Article  Google Scholar 

  3. Carlier, J.: Ordonnancements a contraintes disjunctives. RAIRO Rech. operationelle/Oper. Res. 12, 333–351 (1978)

    Article  MathSciNet  Google Scholar 

  4. Caumond, A., Lacomme, A,P., Tchernev, N.: Proposition d’un algorithme génétique pour le job-shop avec time-lags. In: ROADEF 2005, pp. 183–200 (2005)

    Google Scholar 

  5. Caumond, A., Gourgand, M., Lacomme, P., Tchernev, N.: Métaheuristiques pour le problème de job shop avec time lags”, Jm|li,s j(i)|Cmax. In: 5ème confèrence Francophone de Modélisation et SIMulation (MOSIM 2004). Modélisation et simulation pour l’analyse et l’optimisation des systèmes industriels et logistiques, pp. 939–946. Nantes, France (2004)

    Google Scholar 

  6. Caumond, A., Lacomme, P., Tchernev, N.: Feasible schedule generation with extension of the Giffler and Thompson’s heuristic for the job shop problem with time lags. In: International Conference of Industrial Engineering and Systems Management, pp. 489–499 (2005)

    Google Scholar 

  7. Caumond, A., Lacomme, P., Tchernev, N.: A memetic algorithm for the job-shop with time-lags. Comput. Oper. Res. 35, 2331–2356 (2008)

    Article  MathSciNet  Google Scholar 

  8. Deppner, F.: Ordonnancement d’atelier avec contraintes temporelles entre opérations, Ph.D. thesis, Institut National Polytechnique de Lorraine (2004)

    Google Scholar 

  9. Fisher, H., Thompson, G.L.: Probabilistic Learing Combination of Local Job Shop Scheduling Rules, pp. 225–251. Prentice Hall, Industrial Scheduling (1963)

    Google Scholar 

  10. González, M.A., Oddi, A., Rasconi, R., Varela, R.: Scatter search with path relinking for the job shop with time lags and set up times. Comput. Oper. Res. 60, 37–54 (2015)

    Article  MathSciNet  Google Scholar 

  11. Harrabi, M., Belkahla Driss, O.: MATS-JSTL: a multi-agent model based on tabu search for the job shop problem with time lags. In: International Computational Collective Intelligence Technologies and Applications ICCCI, pp. 39–46 (2015)

    Chapter  Google Scholar 

  12. Harrabi, M., Belkahla Driss, O., Ghedira, K.: Competitive agents implementing parallel tabu searches for job shop scheduling problem with time lags. In: IASTED International Conference on Modelling, Identification and Control, pp. 848–052. MIC (2017)

    Google Scholar 

  13. Harrabi, M., Belkahla Driss, O., Ghedira, K.: Combining genetic algorithm and tabu search for job shop scheduling problem with time lags. In: IEEE International Conference on Engineering & MIS, pp. 1–8 (2017)

    Google Scholar 

  14. Harrabi, M., Belkahla Driss, O., Ghedira, K.: A multi-agent model based on hybrid genetic algorithm for job shop scheduling problem with generic time lags. In: ACS/IEEE International Conference on Computer Systems and Applications AICCSA, pp. 995–1002 (2017)

    Google Scholar 

  15. Karoui, W., Huguet, M.-J., Lopez, P., Haouari, M.: Méthode de recherche à divergence limitée pour les problèmes d’ordonnancement avec contraintes de délais” [Limited discrepancy search for scheduling problems with time-lags]. In: 8ème ENIM IFAC Conférence Internationale de Modélisation et Simulation, Hammamet, Tunisie, pp. 10–12 (2000)

    Google Scholar 

  16. Lacomme, P., Huguet, M.J., Tchernev, N.: Dedicated constraint propagation for job-shop problem with generic time-lags. In: 16th IEEE Conference on Emerging Technologies and Factory Automation IEEE Catalog Number: CFP11ETF-USB, Toulouse, France (2011)

    Google Scholar 

  17. Lacomme, P., Tchernev, N.: Job-shop with generic time lags: a heuristic based approach. In: 9th International Conference of Modeling, Optimization and Simulation – MOSIM (2012)

    Google Scholar 

  18. Lawrence, S.: Supplement to Resource Constrained Project Scheduling: An experimental investigation of Heuristic Scheduling Techniques. Graduate School of Industrial Administration, Carnegie Mellon University (1984)

    Google Scholar 

  19. MacArthur, R., Wilson, E.: The Theory of Biogeography. Princeton University Press, Princeton (1967)

    Google Scholar 

  20. Manne, S.: On the job-shop scheduling problem. Oper. Res. 8, 219–223 (1960)

    Article  MathSciNet  Google Scholar 

  21. Simon, D.: Biogeography-based optimization. IEEE Trans. Evol. Comput. 12, 702–713 (2008)

    Article  Google Scholar 

  22. Wikum, E.D., Lewellynn, D.C., Nemhauser, G.L.: One-machine generalized precedence constrained scheduling problems. Oper. Res. Lett. 16, 87–99 (1994)

    Article  MathSciNet  Google Scholar 

  23. Yang, Y.: A Modified Biogeography-Based Optimization for the Flexible Job Shop Scheduling Problem, Mathematical Problems in Engineering (2015)

    Google Scholar 

  24. Brucker, P.: Scheduling and constraint propagation. Discrete Appl. Math. 123, 227–256 (2002)

    Article  MathSciNet  Google Scholar 

  25. Huang, K.L., Liao, C.J.: Ant colony optimization combined with taboo search for the job shop scheduling problem. Comput. Oper. Res. 35, 1030–1046 (2008)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ecole Nationale des Sciences de l’Informatique, Université de Manouba, Manouba, Tunisia

    Madiha Harrabi

  2. Ecole Supérieure de Commerce de Tunis, Université de Manouba, Manouba, Tunisia

    Olfa Belkahla Driss

  3. Institut Supérieur de Gestion, Université de Tunis, Tunis, Tunisia

    Khaled Ghedira

  4. SOIE-COSMOS Laboratory, Université de Manouba, Manouba, Tunisia

    Madiha Harrabi, Olfa Belkahla Driss & Khaled Ghedira

Authors
  1. Madiha Harrabi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olfa Belkahla Driss
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Khaled Ghedira
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Madiha Harrabi .

Editor information

Editors and Affiliations

  1. Computational Intelligence Group, University of the Basque Country, Sarriena, Vizcaya, Spain

    Manuel Graña

  2. Computational Intelligence Group, University of the Basque Country, Sarriena, Vizcaya, Spain

    José Manuel López-Guede

  3. Computational Intelligence Group, University of the Basque Country, Sarriena, Vizcaya, Spain

    Oier Etxaniz

  4. Department of Civil Engineering, University of Burgos, Burgos, Burgos, Spain

    Álvaro Herrero

  5. University of Salamanca, Salamanca, Salamanca, Spain

    José Antonio Sáez

  6. Department of Industrial Engineering, University of A Coruña, La Coruña, La Coruña, Spain

    Héctor Quintián

  7. University of Salamanca, Salamanca, Salamanca, Spain

    Emilio Corchado

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Harrabi, M., Driss, O.B., Ghedira, K. (2019). A Greedy Biogeography-Based Optimization Algorithm for Job Shop Scheduling Problem with Time Lags. In: Graña, M., et al. International Joint Conference SOCO’18-CISIS’18-ICEUTE’18. SOCO’18-CISIS’18-ICEUTE’18 2018. Advances in Intelligent Systems and Computing, vol 771. Springer, Cham. https://doi.org/10.1007/978-3-319-94120-2_47

Download citation

Publish with us

Policies and ethics

Search

Navigation