Skip to main content
SpringerLink
Log in

A Hybrid Algorithm Based on Ant Colony System for Flexible Job Shop

  • Conference paper
  • First Online:
Applied Computer Sciences in Engineering (WEA 2022)

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

Included in the following conference series:

  • 544 Accesses

Abstract

Today’s competitive marketplace leads customers to demand a higher level of customer satisfaction, by expecting their orders to be delivered quickly. This forces organizations to implement strategies that decrease order delivery time. Typically, to meet this objective, companies schedule production as much efficiently as possible. The success of production scheduling depends on decisions, leading to determining the sequence of activities and the allocation of machines or resources to optimize an objective function. A well-known machine configuration is the Job Shop and its variants, including the Flexible Job Shop (FJS). To solve the FJS, numerous algorithms have been designed, with the most common and computationally efficient being Tabu Search and Genetic Algorithms and their hybridizations. This paper aims to develop a hybrid algorithm with non-common metaheuristics to solve the Flexible Job Shop with makespan minimization. A hybrid algorithm composed of two interacting phases is developed: the first phase is the diversification, which is based on the Ant Colony Optimization algorithm, while the second phase is the improvement which is based on the Iterated Local Search. Instances from the literature are solved to test the algorithm. The results are compared with the best solutions from the literature, showing the power of the proposed algorithm.

Supported by School of Engineering Universidad de La Sabana.

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 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.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. Amjad, M.K., et al.: Recent Research Trends in Genetic Algorithm Based Flexible Job Shop Scheduling Problems. Math. Probl. Eng. 2018, 9270802 (2018)

    Article  Google Scholar 

  2. Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41(3), 157–183 (1993)

    Article  MATH  Google Scholar 

  3. Brucker, P., Schlie, R.: Job-shop scheduling with multi-purpose machines. Computing 45(4), 369–375 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  4. Dauzère-Pérès, S., Paulli, J.: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Anna. Operat. Res. 70, 281–306 (1997)

    Google Scholar 

  5. Dell’Amico, M., Trubian, M.: Applying tabu search to the job-shop scheduling problem. Ann. Oper. Res. 41(3), 231–252 (1993)

    Article  MATH  Google Scholar 

  6. Ding, H., Gu, X.: Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem. Comput. Operat. Res. 121, 104951 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  7. Duarte, A., Sánchez-Oro, J., Mladenović, N., Todosijević, R.: Variable neighborhood descent, pp. 341–367. Springer International Publishing, Cham (2018). https://doi.org/10.1007/978-3-319-07153-4_9-1

  8. García-León, A.A., Torres Tapia, W.F.: A hybrid algorithm to minimize regular criteria in the job-shop scheduling problem with maintenance activities, sequence dependent and set-up times. In: Figueroa-García, J.C., Garay-Rairán, F.S., Hernández-Pérez, G.J., Díaz-Gutierrez, Y. (eds.) WEA 2020. CCIS, vol. 1274, pp. 208–221. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-61834-6_18

    Chapter  Google Scholar 

  9. García-León, A.A., Dauzère-Pérès, S., Mati, Y.: An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria. Comput. Oper. Res. 108, 187–200 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  10. García-León, A.A., Torres Tapia, W.F.: A general local search pareto approach with regular criteria for solving the job-shop scheduling problem multi-resource resource flexibility with linear routes. In: Figueroa-García, J.C., Duarte-González, M., Jaramillo-Isaza, S., Orjuela-Cañon, A.D., Díaz-Gutierrez, Y. (eds.) Applied Computer Sciences in Engineering, pp. 764–775. Springer International Publishing, Cham (2019). https://doi.org/10.1007/978-3-030-31019-6_64

    Chapter  Google Scholar 

  11. Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117–129 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  12. González, M., Vela, C., Varela, R.: Scatter search with path relinking for the flexible job shop scheduling problem. Eur. J. Oper. Res. 245(1), 35–45 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hurink, J., Jurisch, B., Thole, M.: Tabu search for the job-shop scheduling problem with multi-purpose machines. OR Spektrum 15(4), 205–215 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kaplanoğlu, V.: An object-oriented approach for multi-objective flexible job-shop scheduling problem. Expert Syst. Appl. 45, 71–84 (2016)

    Article  Google Scholar 

  15. Li, X., Gao, L.: An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int. J. Prod. Econ. 174, 93–110 (2016)

    Article  Google Scholar 

  16. Mastrolilli, M., Gambardella, L.M.: Effective neighbourhood functions for the flexible job shop problem. J. Sched. 3(1), 3–20 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  17. Nayak, S., Sood, A.K., Pandey, A.: Integrated approach for flexible job shop scheduling using multi-objective genetic algorithm. In: Govindan, K., Kumar, H., Yadav, S. (eds.) Advances in Mechanical and Materials Technology, pp. 387–395. Springer, Singapore (2022). https://doi.org/10.1007/978-981-16-2794-1_35

    Chapter  Google Scholar 

  18. Paulli, J.: A hierarchical approach for the fms scheduling problem. Eur. J. Oper. Res. 86(1), 32–42 (1995)

    Article  MATH  Google Scholar 

  19. Pezzella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the flexible job-shop scheduling problem. Comput. Operat. Res. 35(10), 3202–3212 (2008)

    Article  MATH  Google Scholar 

  20. Roshanaei, V., Azab, A., ElMaraghy, H.: Mathematical modelling and a meta-heuristic for flexible job shop scheduling. Int. J. Prod. Res. 51(20), 6247–6274 (2013)

    Article  Google Scholar 

  21. Sisson, R.L.: Methods of sequencing in job shops-a review. Oper. Res. 7(1), 10–29 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  22. Stützle, T., Hoos, H.: Improvements on the ant-system: Introducing the max-min ant system. In: Artificial Neural Nets and Genetic Algorithms, pp. 245–249. Springer, Vienna (1998). https://doi.org/10.1007/978-3-7091-6492-1_54

  23. Taillard, D.: Parallel taboo search techniques for the job shop scheduling problem. ORSA J. Comput. 6(2), 108–117 (1994)

    Google Scholar 

  24. Torres-Tapia, W., Montoya-Torres, J.R., Ruiz-Meza, J., Belmokhtar-Berraf, S.: A Matheuristic based on ant colony system for the combined flexible jobshop scheduling and vehicle routing problem. In: 10th IFAC Conference on Manufacturing Modelling, Management and Control. Elsevier, Nantes, France (2022)

    Google Scholar 

  25. Wang, L., Cai, J., Li, M., Liu, Z.: Flexible job shop scheduling problem using an improved ant colony optimization. Sci. Program. 2017, 9016303 (2017)

    Google Scholar 

  26. Xia, W., Wu, Z.: An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput. Ind. Eng. 48(2), 409–425 (2005)

    Article  Google Scholar 

  27. Xie, J., Gao, L., Peng, K., Li, X., Li, H.: Review on flexible job shop scheduling. IET Collaborative Intell. Manuf. 1(3), 67–77 (2019)

    Article  Google Scholar 

  28. Xiong, H., Shi, S., Ren, D., Hu, J.: A survey of job shop scheduling problem: The types and models. Comput. Oper. Res. 142, 105731 (2022)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The work presented in this paper was supported by a postgraduate scholarship from the School of Engineering Universidad de La Sabana, Colombia, awarded to the first author.

Author information

Authors and Affiliations

  1. Research Group on Logistics Systems, Universidad de La Sabana, km 7 autopista norte de Bogotá, D.C. Chia, Colombia

    William Torres-Tapia, Jairo R. Montoya-Torres & José Ruiz-Meza

Authors
  1. William Torres-Tapia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jairo R. Montoya-Torres
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. José Ruiz-Meza
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to William Torres-Tapia .

Editor information

Editors and Affiliations

  1. Universidad Distrital Francisco José de Caldas, Bogotá, Colombia

    Juan Carlos Figueroa-García

  2. Universidad del Rosario, Bogotá, Colombia

    Carlos Franco

  3. Universidad de La Salle, Bogotá, Colombia

    Yesid Díaz-Gutierrez

  4. National University of Colombia, Bogotá, Colombia

    Germán Hernández-Pérez

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Torres-Tapia, W., Montoya-Torres, J.R., Ruiz-Meza, J. (2022). A Hybrid Algorithm Based on Ant Colony System for Flexible Job Shop. In: Figueroa-García, J.C., Franco, C., Díaz-Gutierrez, Y., Hernández-Pérez, G. (eds) Applied Computer Sciences in Engineering. WEA 2022. Communications in Computer and Information Science, vol 1685. Springer, Cham. https://doi.org/10.1007/978-3-031-20611-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-20611-5_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-20610-8

  • Online ISBN: 978-3-031-20611-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation