Skip to main content
SpringerLink
Log in

Whale Optimization Algorithm with Local Search for Open Shop Scheduling Problem to Minimize Makespan

  • Conference paper
  • First Online:
Intelligent Computing Theories and Application (ICIC 2019)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11644))

Included in the following conference series:

  • 1435 Accesses

Abstract

In this paper, a hybrid whale optimization algorithm (HWOA) with local search strategy is proposed to minimize the makespan for the Open-shop Scheduling Problem (OSP), which is one of the most important scheduling types in practical applications. Firstly, the large-order-value (LOV) encoding rule is presented to transform HWOA’s individuals from continuous vectors into job permutations, which makes HWOA suitable for dealing with the OSP and performing global search in the solution space. Secondly, a local search mechanism guided by different neighborhoods is designed to enhance the search depth in the promising regions of excellent solutions. Computational experiments and comparisons show that HWOA performs well on random generation problems. This is the first time that HWOA has been used to address the OSP.

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

Similar content being viewed by others

References

  1. Kubiak, W., Sriskandarajah, C., Zaras, K.: A note on the complexity of open shop scheduling problems. Inform. Syst. Oper. Res. 29(4), 284–294 (1991)

    MATH  Google Scholar 

  2. Low, C., Yeh, Y.: Genetic algorithm-based heuristics for an open shop scheduling problem with setup, processing, and removal times separated. Robot. Comput.-Integr. Manuf. 25(2), 314–322 (2009)

    Article  Google Scholar 

  3. Matta, M.E.: A genetic algorithm for the proportionate multiprocessor open shop. Comput. Oper. Res. 36(9), 2601–2618 (2009)

    Article  MathSciNet  Google Scholar 

  4. Prins, C.: An overview of scheduling problems arising in satellite communications. J. Oper. Res. Soc. 45(6), 611–623 (1994)

    Article  Google Scholar 

  5. Liaw, C.F.: An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. Comput. Oper. Res. 30(14), 2081–2095 (2003)

    Article  Google Scholar 

  6. Gonzalez, T.F., Sahni, S.: Open shop scheduling to minimize finish time. J. ACM 23(4), 665–679 (1976)

    Article  MathSciNet  Google Scholar 

  7. Brucker, P., Hurink, J., Jurisch, B., Wostmann, B.: A branch and bound algorithm for the open shop problem. Discrete Appl. Math. 76(1–3), 43–59 (1997)

    Article  MathSciNet  Google Scholar 

  8. Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64(2), 278–285 (1993)

    Article  MathSciNet  Google Scholar 

  9. Liaw, C.F.: A tabu search algorithm for the open shop scheduling problem. Comput. Oper. Res. 26(2), 109–126 (1999)

    Article  MathSciNet  Google Scholar 

  10. Prins, C.: Competitive genetic algorithms for the open-shop scheduling problem. Math. Methods Oper. Res. 52(3), 389–411 (2000)

    Article  MathSciNet  Google Scholar 

  11. Sha, D.Y., Hsu, C.Y.: A new particle swarm optimization for the open shop scheduling problem. Comput. Oper. Res. 35(10), 3243–3261 (2008)

    Article  Google Scholar 

  12. Gao, L., Gao, H.B., Zhou, C.: Open shop scheduling based on particle swarm optimization. J. Mech. Eng. 42(2), 129–134 (2006)

    Article  Google Scholar 

  13. Mirjalili, S., Lewis, A.: The whale optimization algorithm. Adv. Eng. Softw. 95, 51–67 (2016)

    Article  Google Scholar 

  14. Yan, X., Ye, C.M., Yao, Y.Y.: Solving job-shop scheduling problem by quantum whale optimization algorithm. Appl. Res. Comput. 36(04), 1–2 (2019)

    Google Scholar 

  15. Abdel-Basset, M., Gunasekaran, M., El-Shahat, D., et al.: A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem. Future Gener. Comput. Syst. 85, 129–145 (2018)

    Article  Google Scholar 

  16. Qian, B., Zhou, H.-B., Hu, R., Xiang, F.-H.: Hybrid Differential evolution optimization for no-wait flow-shop scheduling with sequence-dependent setup times and release dates. In: Huang, D.-S., Gan, Y., Bevilacqua, V., Figueroa, J.C. (eds.) ICIC 2011. LNCS, vol. 6838, pp. 600–611. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-24728-6_81

    Chapter  Google Scholar 

  17. Giffler, B., Thompson, G.L.: Algorithms for solving production scheduling problems. Oper. Res. 8(4), 487–503 (1960)

    Article  MathSciNet  Google Scholar 

  18. Naderi, B., Ghomi, S.M.T.F., Aminnayeri, M., et al.: A study on open shop scheduling to minimise total tardiness. Int. J. Prod. Res. 49(15), 4657–4678 (2011)

    Article  Google Scholar 

Download references

Acknowledgements

This research is partially supported by National Natural Science Foundation of China (51665025), Applied Basic Research Key Project of Yunnan, China and National Natural Science Fund for Distinguished Young Scholars of China (61525304).

Author information

Authors and Affiliations

  1. School of Information Engineering and Automation, Kunming University of Science and Technology, Kunming, 650500, China

    Hui-Min Gu, Rong Hu, Bin Qian & Huai-Ping Jin

  2. School of Mechanical and Electronic Engineering, Kunming University of Science and Technology, Kunming, 650500, China

    Rong Hu & Bin Qian

  3. Department of Automation, Tsinghua University, Beijing, 100084, China

    Ling Wang

Authors
  1. Hui-Min Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rong Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bin Qian
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Huai-Ping Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ling Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rong Hu .

Editor information

Editors and Affiliations

  1. Tongji University, Shanghai, China

    De-Shuang Huang

  2. University of Ulsan, Ulsan, Korea (Republic of)

    Kang-Hyun Jo

  3. Nanchang Institute of Technology, Nanchang, China

    Zhi-Kai Huang

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

Gu, HM., Hu, R., Qian, B., Jin, HP., Wang, L. (2019). Whale Optimization Algorithm with Local Search for Open Shop Scheduling Problem to Minimize Makespan. In: Huang, DS., Jo, KH., Huang, ZK. (eds) Intelligent Computing Theories and Application. ICIC 2019. Lecture Notes in Computer Science(), vol 11644. Springer, Cham. https://doi.org/10.1007/978-3-030-26969-2_64

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-26969-2_64

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-26968-5

  • Online ISBN: 978-3-030-26969-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation