Skip to main content
SpringerLink
Log in

A Biogeography-Based Memetic Algorithm for Job-Shop Scheduling

  • Conference paper
  • First Online:
Bio-inspired Computing: Theories and Applications (BIC-TA 2018)

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

Abstract

Job shop scheduling problem (JSP) is a well-known combinatorial optimization problem of practical importance, but existing evolutionary algorithms for JSP often face problems of low convergence speed and/or premature convergence. For efficiently solving JSP, this paper proposes a memetic algorithm based on biogeography-based optimization (BBO), named BBMA, which redefines the migration and mutation operators of BBO for JSP, employs a local population topology to suppress premature convergence, and uses a critical-path-based local search operator to enhance the exploitation ability. Numerical experiments on a set of JSP instances show that the proposed BBMA has significantly performance advantage over a number of state-of-the-art evolutionary algorithms.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Banharnsakun, A., Sirinaovakul, B., Achalakul, T.: Job shop scheduling with the best-so-far ABC. Eng. Appl. Artif. Intel. 25(3), 583–593 (2012)

    Article  Google Scholar 

  2. Çaliş, B., Bulkan, S.: A research survey: review of AI solution strategies of job shop scheduling problem. J. Intell. Manuf. 26(5), 961–973 (2015)

    Article  Google Scholar 

  3. Chang, Y.L., Matsuo, H., Sullivan, R.: A bottleneck-based beam search for job scheduling in a flexible manufacturing system. Int. J. Prod. Res. 27, 1949–1961 (1989)

    Article  Google Scholar 

  4. Cruz, C.M.A., Frausto, S.J., Ramos, Q.F.: The problem of using the calculation of the critical path to solver instances of the job shop scheduling problem. Int. J. Comput. Intell. ENFORMATIKA 1(4), 334–337 (2004)

    Google Scholar 

  5. Gao, H., Kwong, S., Fan, B., Wang, R.: A hybrid particle-swarm tabu search algorithm for solving job shop scheduling problems. IEEE Trans. Ind. Inf. 10(4), 2044–2054 (2014)

    Article  Google Scholar 

  6. 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  Google Scholar 

  7. Gonçalves, J.F., Magalhaes, M.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 

  8. 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  MathSciNet  Google Scholar 

  9. Kennedy, J.: Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance. In: Proceedings of the 1999 Congress on Evolutionary Computation, vol. 3, pp. 1931–1938 (1999)

    Google Scholar 

  10. Lawrence, S.: Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Energy Proc. 4(7), 4411–4417 (1984)

    Google Scholar 

  11. Lian, Z., Jiao, B., Gu, X.: A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan. Appl. Math. Comput. 183(2), 1008–1017 (2006)

    MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

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

  14. Ma, H.: An analysis of the equilibrium of migration models for biogeography-based optimization. Inform. Sci. 180(18), 3444–3464 (2010)

    Article  Google Scholar 

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

    Google Scholar 

  16. Mattfeld, D.C., Bierwirth, C.: An efficient genetic algorithm for job shop scheduling with tardiness objectives. Eur. J. Oper. Res. 155(3), 616–630 (2004)

    Article  MathSciNet  Google Scholar 

  17. Moscato, P., Cotta, C.: A gentle introduction to memetic algorithms. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, pp. 105–144. Springer, Boston (2003). https://doi.org/10.1007/0-306-48056-5_5

    Chapter  Google Scholar 

  18. Ong, Y.S., Lim, M.H., Zhu, N., Wong, K.W.: Classification of adaptive memetic algorithms: a comparative study. IEEE Trans. Syst. Man Cybern. Part B 36(1), 141–152 (2006)

    Article  Google Scholar 

  19. Pinedo, M.: Scheduling Theory, Algorithms, and Systems, 2nd edn. Prentice Hall, Upper Saddle River (2002)

    MATH  Google Scholar 

  20. Shao, Z., Pi, D., Shao, W.: A novel discrete water wave optimization algorithm for blocking flow-shop scheduling problem with sequence-dependent setup times. Swarm Evol. Comput. 40(1), 53–75 (2018)

    Article  Google Scholar 

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

    Article  Google Scholar 

  22. Storer, R.H., Wu, S.D., Vaccari, R.: New search spaces for sequencing problems with application to job shop scheduling. Manag. Sci. 38(10), 1495–1509 (1992)

    Article  Google Scholar 

  23. Wang, L., Zheng, D.Z.: A modified genetic algorithm for job shop scheduling. Int. J. Adv. Manuf. Technol. 20(1), 72–76 (2002)

    Article  Google Scholar 

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

    Article  Google Scholar 

  25. Wisittipanich, W., Kachitvichyanukul, V.: Two enhanced differential evolution algorithms for job shop scheduling problems. Int. J. Prod. Res. 50(10), 2757–2773 (2012)

    Article  Google Scholar 

  26. Xing, L.N., Chen, Y.W., Wang, P., Zhao, Q.S., Xiong, J.: A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl. Soft Comput. 10(3), 888–896 (2010)

    Article  Google Scholar 

  27. Zhang, M.X., Zhang, B., Qian, N.: University course timetabling using a new ecogeography-based optimization algorithm. Natural Comput. 16(1), 61–74 (2017)

    Article  MathSciNet  Google Scholar 

  28. Zhang, R., Song, S., Wu, C.: A hybrid differential evolution algorithm for job shop scheduling problems with expected total tardiness criterion. Appl. Soft Comput. 13(3), 1448–1458 (2013)

    Article  Google Scholar 

  29. Zheng, Y.J.: Water wave optimization: a new nature-inspired metaheuristic. Comput. Oper. Res. 55(1), 1–11 (2015)

    Article  MathSciNet  Google Scholar 

  30. Zheng, Y.J., Ling, H.F., Shi, H.H., Chen, H.S., Chen, S.Y.: Emergency railway wagon scheduling by hybrid biogeography-based optimization. Comput. Oper. Res. 43(3), 1–8 (2014)

    Article  MathSciNet  Google Scholar 

  31. Zheng, Y.J., Ling, H.F., Wu, X.B., Xue, J.Y.: Localized biogeography-based optimization. Soft Comput. 18(11), 2323–2334 (2014)

    Article  Google Scholar 

Download references

Acknowledgements

This work is supported by National Natural Science Foundation (Grant No. 61473263 and 61773348) of China.

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou, 310023, China

    Xue-Qin Lu, Yi-Chen Du, Xu-Hua Yang & Yu-Jun Zheng

  2. Institute of Service Engineering, Hangzhou Normal University, Hangzhou, 311121, China

    Yu-Jun Zheng

Authors
  1. Xue-Qin Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yi-Chen Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xu-Hua Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yu-Jun Zheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu-Jun Zheng .

Editor information

Editors and Affiliations

  1. Beijing University of Posts and Telecommunications, Beijing, China

    Jianyong Qiao

  2. Beijing University of Posts and Telecommunications, Beijing, China

    Xinchao Zhao

  3. Huazhong University of Science and Technology, Wuhan, China

    Linqiang Pan

  4. Beijing University of Posts and Telecommunications, Beijing, China

    Xingquan Zuo

  5. Anhui University, Hefei, China

    Xingyi Zhang

  6. City University of Hong Kong, Kowloon, Hong Kong

    Qingfu Zhang

  7. Beijing University of Posts and Telecommunications, Beijing, China

    Shanguo Huang

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lu, XQ., Du, YC., Yang, XH., Zheng, YJ. (2018). A Biogeography-Based Memetic Algorithm for Job-Shop Scheduling. In: Qiao, J., et al. Bio-inspired Computing: Theories and Applications. BIC-TA 2018. Communications in Computer and Information Science, vol 951. Springer, Singapore. https://doi.org/10.1007/978-981-13-2826-8_24

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-2826-8_24

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-2825-1

  • Online ISBN: 978-981-13-2826-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation