Skip to main content
SpringerLink
Log in

Hybrid Biogeography-Based Optimization Algorithm for Job Shop Scheduling Problem with Time Lags and Single Transport Robot

  • Conference paper
  • First Online:
Advances in Computational Collective Intelligence (ICCCI 2021)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1463))

Included in the following conference series:

Abstract

We are interesting for the Job shop Scheduling Problem with Time Lags and Single Transport Robot (JSPTL-STR). This problem is a new extension of the Job shop Scheduling Problem, in which, we take into account two additional constraints; the minimum and maximum time lags constraints between finish and start time of two operations and transportation time constraints of different operations between different machines using a single robot. After the completion of an operation on a machine, it needs to be transported using transport robot to the next machine taking some time. The objective is to determine a feasible schedule of machine operations and transport operations with minimal makespan (Completion time of the last operation executed). This problem belongs to a category of problems known as NP-hard problem. Biogeography-Based Optimization (BBO) algorithm is an evolutionary algorithm inspired by the migration of species between habitats. It has successfully solved optimization problems in many different domains and has demonstrated excellent performance. To assess the performance of the proposed algorithm, a series of experiments on new proposed benchmark instances for JSPTL-STR are performed.

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 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.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)

    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 Recherche operationelle/Operations Research 12, 333–351 (1978)

    Article  Google Scholar 

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

    Google Scholar 

  5. Caumond, A., Gourgand, M., Lacomme, P., Tchernev, N.: Métaheuristiques pour le pro-blè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’04). Modélisation et simulation pour l’analyse et l’optimisation des systèmes industriels et logistiques, Nantes, France, pp. 939–946 (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. Caumond, A., Lacomme, P., Moukrim, A., Tchernev, N.: An MILP for scheduling problems in an FMS with one vehicle. Eur. J. Oper. Res. 199(3), 706–722 (2009)

    Article  Google Scholar 

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

    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. Rahmati, S.H.A., Zandieh, M.: A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem. Int. J. Adv. Manufact. Technol. 58, 1115–1129 (2012). https://doi.org/10.1007/s00170-011-3437-9

    Article  Google Scholar 

  12. Harrabi, M., Olfa, B.D.: MATS–JSTL: a multi-agent model based on Tabu search for job shop problem with time lags. In: Núñez, M., Nguyen, N.T., Camacho, D., Trawiński, B. (eds.) ICCCI 2015. LNCS (LNAI), vol. 9329, pp. 39–46. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-24069-5_4

    Chapter  Google Scholar 

  13. 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, 848–052 MIC (2017)

    Google Scholar 

  14. 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 (2017)

    Google Scholar 

  15. 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 (2017)

    Google Scholar 

  16. Harrabi, M., Driss, O.B., Ghedira, K.: A greedy biogeography-based optimization algorithm for job shop scheduling problem with time lags. In: Graña, M., et al. (eds.) SOCO’18-CISIS’18-ICEUTE’18 2018. AISC, vol. 771, pp. 489–499. Springer, Cham (2019). https://doi.org/10.1007/978-3-319-94120-2_47

    Chapter  Google Scholar 

  17. Harrabi, M., Belkahla Driss, O., Ghedira, K.: A modified biogeography-based optimization algorithm with improved mutation operator for job shop scheduling problem with time lags. Logic J. IGPL, jzaa037 (2020). https://doi.org/10.1093/jigpal/jzaa037

  18. Harrabi, M., Belkahla Driss, O., Ghedira, K.: A hybrid biogeography-based optimization for job shop scheduling problem with generic time lags. J. Sched. (2021, in press). https://doi.org/10.1007/s10951-021-00683-w

  19. Hurink, J., Knust, S.: A Tabu search algorithm for scheduling a single robot in a job-shop environment. Discrete Appl. Math. 119(12), 181203 (2002)

    MathSciNet  MATH  Google Scholar 

  20. Hurink, J., Knust, S.: Tabu search algorithms for job-shop problems with a single transport robot. Eur. J. Oper. Res. 162(1), 99111 (2005)

    Article  Google Scholar 

  21. 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. In: ENIM IFAC Conférence Internationale de Modélisation et Simulation (2010)

    Google Scholar 

  22. Lacomme, P., Moukrim, A., Tchernev, N.: Simultaneous job input sequencing and vehicle dispatching in a single-vehicle automated guided vehicle system: a heuristic branch-and-bound approach coupled with a discrete events simulation model. Int. J. Prod. Res. 43(9), 1911–1942 (2005)

    Article  Google Scholar 

  23. 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, Toulouse, France (2011). IEEE catalog number: CFP11ETF-USB

    Google Scholar 

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

  25. Lin, J.: A hybrid discrete biogeography-based optimization for the permutation flow shop scheduling problem. Int. J. Prod. Res. 54(16), 1–10 (2016)

    Article  Google Scholar 

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

    Google Scholar 

  27. Rabiee, M., Jolai, F., Asefi, H., Fattahi, P.: A biogeography-based optimization algorithm for a realistic no-wait hybrid flow shop with unrelated parallel machines to minimize mean tardiness. Int. J. Comput. Integr. Manufact. 29, 1007–1024 (2016)

    Article  Google Scholar 

  28. Roy, B., Sussmann, B.: Les problèmes d’ordonnancement avec contraintes disjonctives. Technical report, SEMA (1964)

    Google Scholar 

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

    Article  Google Scholar 

  30. Wang, X., Duan, H.: A hybrid biogeography-based optimization algorithm for job shop scheduling problem. Comput. Ind. Eng. 73, 96–114 (2014)

    Article  Google Scholar 

  31. Yang, Y.: A modified biogeography-based optimization for the flexible job shop scheduling problem. Math. Prob. Eng. 2015, 1–10 (2015)

    Google Scholar 

  32. Helman, P.: A theory of greedy structures based on K-ary dominance relations. Technical Report CS89-11, University of New Mexico, Department of Computer Science (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Madiha Harrabi

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

    Olfa Belkahla Driss

  3. ESPRIT School of Engineering Tunis, Ariana, Tunisia

    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

Editor information

Editors and Affiliations

  1. Wrocław University of Science and Technology, Wrocław, Poland

    Krystian Wojtkiewicz

  2. VU Amsterdam, Amsterdam, The Netherlands

    Jan Treur

  3. University of the West of England, Bristol, UK

    Elias Pimenidis

  4. Wrocław University of Science and Technology, Wrocław, Poland

    Marcin Maleszka

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Harrabi, M., Driss, O.B., Ghedira, K. (2021). Hybrid Biogeography-Based Optimization Algorithm for Job Shop Scheduling Problem with Time Lags and Single Transport Robot. In: Wojtkiewicz, K., Treur, J., Pimenidis, E., Maleszka, M. (eds) Advances in Computational Collective Intelligence. ICCCI 2021. Communications in Computer and Information Science, vol 1463. Springer, Cham. https://doi.org/10.1007/978-3-030-88113-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-88113-9_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-88112-2

  • Online ISBN: 978-3-030-88113-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation