Skip to main content
SpringerLink
Log in

Discrete Harmony Search Algorithm for Flexible Job-Shop Scheduling Problems

  • 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 952))

Abstract

As an emerging algorithm, harmony search (HS) algorithm has been applied into the continuous optimization field and shows amazing performance. The paper aims to study its performance when solving discrete optimization problems. Since the flexible job shop scheduling problem (FJSP) is a typical discrete optimization problem, we propose a discrete harmony search (DHS) algorithm to solve the FJSP. Constructing new solutions by dealing with vector components separately in original HS is inappropriate to combinatorial optimization problems, hence DHS generates new solutions by dealing with solution as a whole. Based on DHS this paper proposes an improved discrete harmony search (IDHS) algorithm. A learning process is added when generating a new solution in IDHS. The candidate solution from harmony memory has the possibility to be adjusted by learning from the current best solution and less possibility not to participate in the learning process, which can help accelerate convergence speed and avoid premature. Computational results show that both DHS and IDHS can search the optimal solution for small and medium scale instances with limited time, but IDHS is more effective in solving large-scale instances.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Ahmadi, E., Zandieh, M., Farrokh, M.: A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms. Comput. Oper. Res. 73, 56–66 (2016)

    Article  MathSciNet  Google Scholar 

  2. Zhang, G.H., Dang, S.J.: Research on flexible job-shop scheduling problem considering job movement time. Appl. Res. Comput. 34(8), 2329–2331 (2017)

    Google Scholar 

  3. Chen, M., Hu, L.Y., Liu, J.F.: Multi-objective flexible job shop scheduling problem based on particle swarm optimization. Mechatronics 1, 11–15 (2017)

    Google Scholar 

  4. Zhao, B.X., Gao, J.M., Chen, K.: Two-stage hybrid pareto ant colony algorithm for multi-objective flexible job shop scheduling. J. Xi’an Jiaotong Univ. 50(7), 145–151 (2016)

    MathSciNet  MATH  Google Scholar 

  5. Wu, X.L., Zhang, Z.Q., Du, Y.H.: Improved bacteria foraging optimization algorithm for flexible job shop scheduling problem. Comput. Integr. Manuf. Syst. 21(5), 1262–1270 (2015)

    Google Scholar 

  6. Lu, H.D., He, W.P., Zhou, X.: An integrated tabu search algorithm for the lot streaming problem in flexible job shops. J. Shanghai Jiaotong Univ. 46(12), 2003–2008 (2012)

    Google Scholar 

  7. Wang, W.L., Fan, L.X., Xu, X.L.: Multi-objective differential evolution algorithm for flexible job shop batch scheduling problem. Comput. Integr. Manuf. Syst. 19(10), 2481–2492 (2013)

    Google Scholar 

  8. Azzouz, A., Ennigrou, M., Said, L.B.: A self-adaptive hybrid algorithm for solving flexible job-shop problem with sequence dependent setup time. Procedia Comput. Sci. 112, 457–466 (2017)

    Article  Google Scholar 

  9. Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60–68 (2001)

    Article  Google Scholar 

  10. Lee, K.S., Geem, Z.W.: A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice. Comput. Methods Appl. Mech. Eng. 194(36), 3902–3933 (2005)

    Article  Google Scholar 

  11. Yuan, Y., Xu, H., Yang, J.D.: A hybrid harmony search algorithm for the flexible job shop scheduling problem. Appl. Soft Comput. 13, 3259–3272 (2013)

    Article  Google Scholar 

  12. Gao, K.Z., Suganthan, P.N., Pan, Q.K.: Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling. Inf. Sci. 289, 76–90 (2014)

    Article  MathSciNet  Google Scholar 

  13. Maroosi, A., Muniyandi, R.C., Sundarajan, E.: A parallel membrane inspired harmony search for optimization problems: a case study based on a flexible job shop scheduling problem. Appl. Soft Comput. 49, 120–136 (2016)

    Article  Google Scholar 

  14. Kacem, I., Hammadi, S., Bome, P.: Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems. IEEE Syst. Man Cybern. Soc. 32(1), 1–13 (2002)

    Article  Google Scholar 

  15. Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41(3), 157–183 (1993)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mechanical Engineering, University of Science and Technology Beijing, Beijing, 100083, China

    Xiuli Wu & Jing Li

Authors
  1. Xiuli Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jing Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiuli Wu .

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

Wu, X., Li, J. (2018). Discrete Harmony Search Algorithm for Flexible Job-Shop Scheduling Problems. In: Qiao, J., et al. Bio-inspired Computing: Theories and Applications. BIC-TA 2018. Communications in Computer and Information Science, vol 952. Springer, Singapore. https://doi.org/10.1007/978-981-13-2829-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-2829-9_4

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-2828-2

  • Online ISBN: 978-981-13-2829-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation