Skip to main content
SpringerLink
Log in
Book cover

Proceedings of Fourth International Conference on Soft Computing for Problem Solving pp 99–111Cite as

Cuckoo Search Optimization for Job Shop Scheduling Problem

  • Conference paper
  • First Online:

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

Abstract

In this paper, a novel hybrid algorithm incorporating the cuckoo search optimization (CSO) technique and an Assorted Individual Enhancement Scheme is proposed to solve the ob shop scheduling problem (JSSP) with an objective to minimize the makespan. The proposed hybrid algorithm is applied to 20 job shop problem instances available in OR-Library and the results are compared with simple CSO. Analysis suggests that the hybrid approach is more effective and robust toward JSSP than simple CSO technique.

This is a preview of subscription content, 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

Learn about institutional subscriptions

References

  1. Yang, X.-S.: Nature-inspired Metaheuristic Algorithms. Luniver Press, UK (2010)

    Google Scholar 

  2. Goncalves, J.F., et al.: A hybrid genetic algorithm for the job shop scheduling problem. Eur. J. Oper. Res. 167(1), 77–95 (2005)

    Article  MATH  Google Scholar 

  3. Meeran, S., Morshed, M.S.: A hybrid genetic tabu search algorithm for solving job shop scheduling problems: a case study. J. Intell. Manuf. 23(4), 1063–1078 (2012)

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Tasgetiren, M.F., et al.: A particle swarm optimization and differential evolution algorithms for job shop scheduling problem. Int. J. Oper. Res. 3(2), 120–135 (2006)

    MathSciNet  Google Scholar 

  6. Ge, H., et al.: A hybrid algorithm based on particle swarm optimization and simulated annealing for job shop scheduling. In: Third International Conference on Natural Computation, 2007. ICNC 2007, pp. 715–719 (2007)

    Google Scholar 

  7. Ge, H.-W., et al.: An effective PSO and AIS-based hybrid intelligent algorithm for job-shop scheduling. IEEE Trans. Syst. Man Cybern. Part A Syst. Hum. 38(2), 358–368 (2008)

    Article  Google Scholar 

  8. Lin, T.-L., et al.: An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Syst. Appl. 37(3), 2629–2636 (2010)

    Article  Google Scholar 

  9. Banharnsakun, A., et al.: Job shop scheduling with the best-so-far ABC. Eng. Appl. Artif. Intell. 25(3), 583–593 (2012)

    Article  Google Scholar 

  10. Yang, X.-S., Deb, S.: Cuckoo search via Levy flights. In: World Congress on Nature Biologically Inspired Computing, 2009. NaBIC 2009, pp. 210–214 (2009)

    Google Scholar 

  11. Yang, X.-S., Deb, S.: Engineering optimisation by cuckoo search. Int. J. Math. Model. Numer. Optim. 1(4), 330–343 (2010)

    MATH  Google Scholar 

  12. Leccardi M.: Comparison of three algorithms for Levy noise generation. In: Proceedings of Fifth EUROMECH Nonlinear Dynamics Conference (2005)

    Google Scholar 

  13. Beasley, J.E.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069 (1990)

    Google Scholar 

  14. OR-Library Job shop scheduling. http://people.brunel.ac.uk/~mastjjb/jeb/orlib/files/jobshop1.txt

Download references

Author information

Authors and Affiliations

  1. Indian Institute of Information Technology, Allahabad, 211012, Uttar Pradesh, India

    Shekhar Singh & Krishna Pratap Singh

Authors
  1. Shekhar Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Krishna Pratap Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shekhar Singh .

Editor information

Editors and Affiliations

  1. Mathematics, National Institute of Technology Silchar, Silchar, Assam, India

    Kedar Nath Das

  2. Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, India

    Kusum Deep

  3. Department of Paper Technology, Indian Institute of Technology Roorkee, Roorkee, India

    Millie Pant

  4. Department of Mathematics, South Asian University, New Delhi, India

    Jagdish Chand Bansal

  5. Department of Computer Science, Liverpool Hope University, Liverpool, United Kingdom

    Atulya Nagar

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer India

About this paper

Cite this paper

Singh, S., Singh, K.P. (2015). Cuckoo Search Optimization for Job Shop Scheduling Problem. In: Das, K., Deep, K., Pant, M., Bansal, J., Nagar, A. (eds) Proceedings of Fourth International Conference on Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 335. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2217-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2217-0_9

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2216-3

  • Online ISBN: 978-81-322-2217-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation