Skip to main content
SpringerLink
Log in

Optimization of Makespan in Job Shop Scheduling Problem by Hybrid Chicken Swarm Algorithm

  • Conference paper
  • First Online:
Advanced Intelligent Systems for Sustainable Development (AI2SD’2018) (AI2SD 2018)

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

  • 868 Accesses

Abstract

This paper presents an adaptation of a new metaheuristic called Chicken swarm optimization with simulated annealing (CSOSA) to solve the job shop scheduling problem (JSSP). The objective is to optimize the makespan by involving chicken swarm algorithm which take into consideration the behavior and the hierarchical order of chicken swarm while seeking for food. The performance of the proposed algorithm is enhanced with an hybridization of CSO with simulated annealing (SA). Furthermore, we propose to integrate the pair-exchange method which is used on each machine to improve the solution quality. The empirical results are obtained by applying the new algorithm on some instances of OR-Library. The computational results demonstrate the effectiveness of the CSOSA comparing to other existing metaheuristics from literature in term of quality of solution and run time for the various benchmark.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Jain, A.S., Meeran, S.: Deterministic job-shop scheduling: past, present and future. Eur. J. Oper. Res. 113(2), 390–434 (1999)

    Article  Google Scholar 

  2. Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Manag. Sci. 34(3), 391–401 (1988)

    Article  MathSciNet  Google Scholar 

  3. Brucker, P., Jurisch, B., Sievers, B.: A branch and bound algorithm for the job-shop scheduling problem. Discr. Appl. Math. 49(1–3), 107–127 (1994)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  5. Peng, B., Lü, Z., Cheng, T.: A tabu search/path relinking algorithm to solve the job shop scheduling problem. Comput. Oper. Res. 53, 154–164 (2015)

    Article  MathSciNet  Google Scholar 

  6. Kolonko, M.: Some new results on simulated annealing applied to the job shop scheduling problem. Eur. J. Oper. Res. 113(1), 123–136 (1999)

    Article  Google Scholar 

  7. Cheng, R., Gen, M., Tsujimura, Y.: A tutorial survey of job-shop scheduling problems using genetic algorithms-I. Representation. Comput. Ind. Eng. 30(4), 983–997 (1996)

    Article  Google Scholar 

  8. Wang, Y., et al.: A new hybrid genetic algorithm for job shop scheduling problem. Comput. Oper. Res. 39(10), 2291–2299 (2012)

    Article  MathSciNet  Google Scholar 

  9. Asadzadeh, L.: A local search genetic algorithm for the job shop scheduling problem with intelligent agents. Comput. Ind. Eng. 85, 376–383 (2015)

    Article  Google Scholar 

  10. Foo, S.Y., Takefuji, Y., Szu, H.: Scaling properties of neural networks for job-shop scheduling. Neurocomputing 8(1), 79–91 (1995)

    Article  Google Scholar 

  11. Sha, D., Hsu, C.-Y.: A hybrid particle swarm optimization for job shop scheduling problem. Comput. Ind. Eng. 51(4), 791–808 (2006)

    Article  Google Scholar 

  12. Xia, W.-J., Wu, Z.-M.: A hybrid particle swarm optimization approach for the job-shop scheduling problem. Int. J. Adv. Manufact. Technol. 29(3–4), 360–366 (2006)

    Article  Google Scholar 

  13. Sundar, S., Suganthan, P.N., Jin, C.T., Xiang, C.T., Soon, C.C.: A hybrid artificial bee colony algorithm for the job-shop scheduling problem with no-wait constraint. Soft Comput. 21(5), 1193–1202 (2017)

    Article  Google Scholar 

  14. Nazif, H., et al.: Solving job shop scheduling problem using an ant colony algorithm. J. Asian Sci. Res. 5(5), 261–268 (2015)

    Google Scholar 

  15. Khadwilard, A., Chansombat, S., Thepphakorn, T., Thapatsuwan, P., Chainate, W., Pongcharoen, P.: Application of firefly algorithm and its parameter setting for job shop scheduling. J. Ind. Technol. 8(1) (2012)

    Google Scholar 

  16. Aiex, R.M., Binato, S., Resende, M.G.: Parallel grasp with path-relinking for job shop scheduling. Parallel Comput. 29(4), 393–430 (2003)

    Article  MathSciNet  Google Scholar 

  17. Gonçalves, J.F., de Magalhães Mendes, J.J., Resende, M.G.: A hybrid genetic algorithm for the job shop scheduling problem. Eur. J. Oper. Res. 167(1), 77–95 (2005)

    Article  MathSciNet  Google Scholar 

  18. Meng, X., Liu, Y., Gao, X., Zhang, H.: A new bio-inspired algorithm: chicken swarm optimization. In: International Conference in Swarm Intelligence, pp. 86–94. Springer (2014)

    Google Scholar 

  19. Wu, D., Kong, F., Gao, W., Shen, Y., Ji, Z.: Improved chicken swarm optimization. In: 2015 IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems (CYBER), pp. 681–686. IEEE (2015)

    Google Scholar 

  20. Tate, D.M., Smith, A.E.: A genetic approach to the quadratic assignment problem. Comput. Oper. Res. 22(1), 73–83 (1995)

    Article  Google Scholar 

  21. Ahmed, Z.: A simple genetic algorithm using sequential constructive crossover for the quadratic assignment problem (2014)

    Google Scholar 

  22. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)

    Article  MathSciNet  Google Scholar 

  23. Rameshkumar, K., Rajendran, C.: A novel discrete PSO algorithm for solving job shop scheduling problem to minimize makespan. In: IOP Conference Series: Materials Science and Engineering, vol. 310, p. 012143. IOP Publishing (2018)

    Google Scholar 

  24. Bouzidi, A., Riffi, M.E.: Cat swarm optimization to solve job shop scheduling problem. In: 2014 Third IEEE International Colloquium in Information Science and Technology (CIST), pp. 202–205. IEEE (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LAMAPI Laboratory, Department of Mathematics, Faculty of Sciences, University of Chouaib Doukkali, El Jadida, Morocco

    Soukaina Cherif Bourki Semlali, Mohammed Essaid Riffi & Fayçal Chebihi

Authors
  1. Soukaina Cherif Bourki Semlali
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammed Essaid Riffi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fayçal Chebihi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Soukaina Cherif Bourki Semlali .

Editor information

Editors and Affiliations

  1. Faculty of Sciences and Techniques, Abdelmalek Essaâdi University, Tangier, Morocco

    Mostafa Ezziyyani

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cherif Bourki Semlali, S., Essaid Riffi, M., Chebihi, F. (2019). Optimization of Makespan in Job Shop Scheduling Problem by Hybrid Chicken Swarm Algorithm. In: Ezziyyani, M. (eds) Advanced Intelligent Systems for Sustainable Development (AI2SD’2018). AI2SD 2018. Advances in Intelligent Systems and Computing, vol 915. Springer, Cham. https://doi.org/10.1007/978-3-030-11928-7_32

Download citation

Publish with us

Policies and ethics

Search

Navigation