Skip to main content
Springer Nature Link
Log in

Thermal Artificial Bee Colony Algorithm for Large Scale Job Shop Scheduling Problems

  • Original Research
  • Published:
SN Computer Science Aims and scope Submit manuscript

Abstract

The job-shop scheduling problem (JSSP) is among the prominent issues in scheduling. Although swarm intelligence (SI) centered algorithms are executing effectively to solve JSSP, yet to find the optimum solution for large-scale JSSP instances is still an inspirational task. In SI algorithms, the artificial bee colony (ABC) algorithm is iconic for efficiently dealing with physical world optimization problems; however, its basic version may suffer from stagnation problem. A temperature-based solution search mechanism is mingled with ABC following the scout honeybee phase to overcome the above weakness. The proposed variant is designated as thermal ABC. Further, a discrete version of thermal ABC is designed to solve 105 large-scale instances of JSSP. The considered instances include 15 SWV, 40 DMU, and 50 TA instances. The obtained outcomes and statistical analysis validate the competitiveness of the proposed approach to solve large-scale JSSP.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Al Alwan B, Abu Bakar M, Faridi WA, Turcu AC, Akgül A, Sallah M. The propagating exact solitary waves formation of generalized calogero-bogoyavlenskii-schiff equation with robust computational approaches. Fractal Fract. 2023;7(2):191.

    Article  Google Scholar 

  2. Asadzadeh, L. A parallel artificial bee colony algorithm for the job shop scheduling problem with a dynamic migration strategy. Comput Ind Eng 2016

  3. Banharnsakun A, Sirinaovakul B, Achalakul T. Job shop scheduling with the best-so-far abc. Eng Appl Artificial Intell. 2012;25(3):583–93.

    Article  Google Scholar 

  4. Clerc, M. Kennedy, J. Standard pso 2011. Particle Swarm Central Site [online] http://www. particleswarm. info. 2011;

  5. Cooper PD, Schaffer WM, Buchmann SL. Temperature regulation of honey bees (apis mellifera) foraging in the sonoran desert. J Exp Biol. 1985;114(1):1–15.

    Article  Google Scholar 

  6. Demirkol E, Mehta S, Uzsoy R. Benchmarks for shop scheduling problems. Euro J Oper Res. 1998;109(1):137–41.

    Article  MATH  Google Scholar 

  7. Gao L, Li X, Wen X, Lu C, Wen F. A hybrid algorithm based on a new neighborhood structure evaluation method for job shop scheduling problem. Comput Ind Eng. 2015;88:417–29.

    Article  Google Scholar 

  8. Gonçalves JF, de Magalhães Mendes JJ, Resende MG. A hybrid genetic algorithm for the job shop scheduling problem. Euro J Oper Res. 2005;167(1):77–95.

    Article  MathSciNet  MATH  Google Scholar 

  9. Gonçalves JF, Resende MG. A biased random-key genetic algorithm for job-shop scheduling. AT &T Labs Res Tech Rep. 2011;46:253–71.

    Google Scholar 

  10. HEINRICH, B. Mechanisms of body-temperature: I. regulation in honeybees, apis mellifera regulation of head temperature. J Exp Biol. 1980;85(1):61–72.

  11. Iqbal MS, Yasin MW, Ahmed N, Akgül A, Rafiq M, Raza A. Numerical simulations of nonlinear stochastic newell-whitehead-segel equation and its measurable properties. J Comput Appl Math. 2023;418: 114618.

    Article  MathSciNet  MATH  Google Scholar 

  12. Karaboga D (2005) An idea based on honey bee swarm for numerical optimizationTechnical report-tr06, Erciyes university, engineering faculty, computer engineering department

  13. Karaboga D, Akay B. A comparative study of artificial bee colony algorithm. Appl Math Comput. 2009;214(1):108–32.

    MathSciNet  MATH  Google Scholar 

  14. Keesari H, Rao R. Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm. Opsearch. 2014;51(4):545–61.

    Article  MathSciNet  MATH  Google Scholar 

  15. Lin TL, Horng SJ, Kao TW, Chen YH, Run RS, Chen RJ, Kuo IH. An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Syst Appl. 2010;37(3):2629–36.

    Article  Google Scholar 

  16. Mehmood N, Abbas A, Akgül A, Abdeljawad T. Alqudah, M A. Existence and stability results for coupled system of fractional differential equations involving ab-caputo derivative. Fractals. 2023;31(02):2340023.

  17. Nasiri MM, Kianfar F. A guided tabu search/path relinking algorithm for the job shop problem. Int J Adv Manuf Technol. 2012;58(9–12):1105–13.

    Article  Google Scholar 

  18. Nowicki E, Smutnicki C. An advanced tabu search algorithm for the job shop problem. J Scheduling. 2005;8(2):145–59.

    Article  MathSciNet  MATH  Google Scholar 

  19. Pardalos PM, Shylo OV. An algorithm for the job shop scheduling problem based on global equilibrium search techniques. Comput Manag Sci. 2006;3(4):331–48.

    Article  MathSciNet  MATH  Google Scholar 

  20. Pardalos PM, Shylo OV, Vazacopoulos A. Solving job shop scheduling problems utilizing the properties of backbone and “big valley’’. Comput Opt Appl. 2010;47(1):61–76.

    Article  MathSciNet  MATH  Google Scholar 

  21. Qian B, Wang L, Hu R, Wang WL, Huang DX, Wang X. A hybrid differential evolution method for permutation flow-shop scheduling. Int J Adv Manuf Technol. 2008;38(7–8):757–77.

    Article  Google Scholar 

  22. Rao RV, Savsani VJ, Vakharia D. Teaching-learning-based optimization: an optimization method for continuous non-linear large scale problems. Inform Sci. 2012;183(1):1–15.

    Article  MathSciNet  Google Scholar 

  23. Schultz SR, Hodgson TJ, King RE. On solving the classic job shop makespan problem by minimizing lmax. Raleigh, NC: Department of Industrial Engineering, North Carolina State University; 2004.

    Google Scholar 

  24. Shahzad A, Imran M, Tahir M, Khan SA, Akgül A, Abdullaev S. . . . Yahia, I S. Brownian motion and thermophoretic diffusion impact on darcy-forchheimer flow of bioconvective micropolar nanofluid between double disks with cattaneo-christov heat flux. Alexandria Eng J. 2023;62:1–15.

  25. Sharma N, Sharma H, Sharma A. Beer froth artificial bee colony algorithm for job-shop scheduling problem. Appl Soft Comput. 2018;68:507–24.

    Article  Google Scholar 

  26. Sharma, N. , Sharma, H. Sharma, A.2019. An effective solution for large scale single machine total weighted tardiness problem using lunar cycle inspired artificial bee colony algorithm.IEEE/ACM transactions on computational biology and bioinformatics.

  27. Sharma, N. , Sharma, H. , Sharma, A. Bansal, J C. 2016. Modified artificial bee colony algorithm based on disruption operator.Proceedings of Fifth International Conference on Soft Computing for Problem Solving (889–900).

  28. Stabentheiner A, Pressl H, Papst T, Hrassnigg N, Crailsheim K. Endothermic heat production in honeybee winter clusters. J Exp Biol. 2003;206(2):353–8.

    Article  Google Scholar 

  29. Storer RH, Wu SD, Vaccari R. New search spaces for sequencing problems with application to job shop scheduling. Manag Sci. 1992;38(10):1495–509.

    Article  MATH  Google Scholar 

  30. Sundar S, Suganthan PN, Jin CT, Xiang CT, Soon CC. A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint. Soft Comput. 2017;21(5):1193–202.

    Article  Google Scholar 

  31. Szabo TI. Effect of weather factors on honeybee flight activity and colony weight gain. J Apicult Res. 1980;19(3):164–71.

    Article  Google Scholar 

  32. Taillard E. Benchmarks for basic scheduling problems. Euro J Oper Res. 1993;64(2):278–85.

    Article  MathSciNet  MATH  Google Scholar 

  33. Tamilarasi A. Kumar, T A. Job-shop scheduling using random key encoding scheme particle swarm optimization. Int J Comput Intell Res. 2010;6(1):33–43.

  34. Ullah N, Asjad MI, Hussanan A, Akgül A, Alharbi WR, Algarni H, Yahia I. Novel waves structures for two nonlinear partial differential equations arising in the nonlinear optics via sardar-subequation method. Alexandria Eng J. 2023;71:105–13.

    Article  Google Scholar 

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

    Article  Google Scholar 

  36. Xiao S, Wang W, Wang H, Huang Z. A new multi-objective artificial bee colony algorithm based on reference point and opposition. Int J Bio-Inspired Comput. 2022;19(1):18–28.

    Article  Google Scholar 

  37. Yaghoobi T, Esmaeili E. An improved artificial bee colony algorithm for global numerical optimisation. Int J Bio-Inspired Comput. 2017;9(4):251–8.

    Article  Google Scholar 

  38. Yao, B Z. , Yang, C Y. , Hu, J J. , Yin, G D. Yu, B.2010. An improved artificial bee colony algorithm for job shop problem. Appl Mech Materials (26, 657–660).

  39. Yin M, Li X, Zhou J. An efficient job shop scheduling algorithm based on artificial bee colony. Sci Res Essays. 2011;6(12):2578–96.

    Google Scholar 

  40. Zhang C, Li P, Guan Z, Rao Y. A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput Oper Res. 2007;34(11):3229–42.

    Article  MathSciNet  MATH  Google Scholar 

  41. Zhang CY, Li P, Rao Y, Guan Z. A very fast ts/sa algorithm for the job shop scheduling problem. Comput Oper Res. 2008;35(1):282–94.

    Article  MathSciNet  MATH  Google Scholar 

  42. Zhao F, Qin S, Yang G, Ma W, Zhang C, Song H. A differential-based harmony search algorithm with variable neighborhood search for job shop scheduling problem and its runtime analysis. IEEE Access. 2018;6:76313–30.

    Article  Google Scholar 

  43. Zhu G, Kwong S. Gbest-guided artificial bee colony algorithm for numerical function optimization. Appl Math Comput. 2010;217(7):3166–73.

    MathSciNet  MATH  Google Scholar 

Download references

Funding

This study was not funded from anywhere.

Author information

Authors and Affiliations

  1. Rajasthan Technical University, Kota, India

    Nirmala Sharma, Harish Sharma & Ajay Sharma

Authors
  1. Nirmala Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Harish Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ajay Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ajay Sharma.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Research involving human participants and/or animals (Ethical approval)

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This article is part of the topical collection “Research Trends in Computational Intelligence” guest edited by Anshul Verma, Pradeepika Verma, Vivek Kumar Singh and S. Karthikeyan.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sharma, N., Sharma, H. & Sharma, A. Thermal Artificial Bee Colony Algorithm for Large Scale Job Shop Scheduling Problems. SN COMPUT. SCI. 4, 683 (2023). https://doi.org/10.1007/s42979-023-02141-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s42979-023-02141-0

Keywords