[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Reinforcement Learning-Based Estimation of Distribution Algorithm for Energy-Efficient Distributed Heterogeneous Flexible Job Shop Scheduling Problem

  • Conference paper
  • First Online:
Advanced Intelligent Computing Technology and Applications (ICIC 2024)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14862))

Included in the following conference series:

  • 347 Accesses

Abstract

The energy-efficient distributed heterogeneous flexible job shop scheduling problem (DHFJSP), incorporating green objectives and multi-factory production models, is a widespread but challenging problem in the manufacturing industry. A reinforcement learning-based estimation of distribution algorithm (RLEDA) is proposed to solve the energy-efficient DHFJSP while minimizing the makespan and total energy consumption (TEC). A hybrid heuristic initialization method is devised to obtain a high-quality population. Two probabilistic models are employed to generate new solutions based on the characteristics of the sub-problems to avoid premature convergence. The Q-learning-based population learning rate adaptive mechanism adjusts the degree of learning information from dominant individuals to improve the distribution of the population. Thirty instances of different scales are utilized to evaluate the effectiveness of the RLEDA. The experimental results show that the RLEDA outperforms the comparison algorithms in solving energy-efficient DHFJSP.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 51.99
Price includes VAT (United Kingdom)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 64.99
Price includes VAT (United Kingdom)
  • 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. Okwudire, C.E., Madhyastha, H.V.: Distributed manufacturing for and by the masses. Science 372(6540), 341–342 (2021)

    Article  Google Scholar 

  2. Dauzère-Pérès, S., Ding, J., Shen, L., Tamssaouet, K.: The flexible job shop scheduling problem: A review. Eur. J. Oper. Res. 314(2), 409–432 (2024)

    Article  MathSciNet  Google Scholar 

  3. Luo, Q., Deng, Q.W., Gong, G.L., Guo, X., Liu, X.H.: A distributed flexible job shop scheduling problem considering worker arrangement using an improved memetic algorithm. Expert Syst. Appl. 207, 117984 (2022)

    Article  Google Scholar 

  4. Luo, C., Gong, W.Y., Li, R., Lu, C.: Problem-specific knowledge MOEA/D for energy-efficient scheduling of distributed permutation flow shop in heterogeneous factories. Eng. Appl. Artif. Intell. 123, 106454 (2023)

    Article  Google Scholar 

  5. Shao, W.S., Shao, Z.S., Pi, D.C.: A network memetic algorithm for energy and labor-aware distributed heterogeneous hybrid flow shop scheduling problem. Swarm Evol. Comput. 75, 101190 (2022)

    Article  Google Scholar 

  6. Li, M., Wang, G.G.: A review of green shop scheduling problem. Inf. Sci. 589, 478–496 (2022)

    Article  Google Scholar 

  7. Larrañaga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Springer, New York (2001). https://doi.org/10.1007/978-1-4615-1539-5

  8. Qian, B., Zhang, Z.-Q., Hu, R., Jin, H.-P., Yang, J.-B.: A matrix-cube-based estimation of distribution algorithm for no-wait flow-shop scheduling with sequence-dependent setup times and release times. IEEE Trans. Syst. Man Cybern. Syst. 53(3), 1492–1503 (2023)

    Google Scholar 

  9. Zhao, F.Q., Zhu, B., Wang, L.: An Estimation of distribution algorithm-based hyper-heuristic for the distributed assembly mixed no-idle permutation flowshop scheduling problem. IEEE Trans. Syst. Man Cybern.: Syst. 53(9), 5626–5637 (2023)

    Google Scholar 

  10. Du, Y., Li, J.Q., Luo, C., Meng, L.L.: A hybrid estimation of distribution algorithm for distributed flexible job shop scheduling with crane transportations. Swarm Evol. Comput. 62, 100861 (2021)

    Article  Google Scholar 

  11. Li, Z.C., Qian, B., Hu, R., Chang, L.L., Yang, J.B.: An elitist nondominated sorting hybrid algorithm for multi-objective flexible job-shop scheduling problem with sequence-dependent setups. Knowl. Based Syst. 173, 83–112 (2019)

    Article  Google Scholar 

  12. Zhang, G.H., Yan, S.F., Song, X.H., Zhang, D.Y., Guo, S.H.: Evolutionary algorithm incorporating reinforcement learning for energy-conscious flexible job-shop scheduling problem with transportation and setup times. Eng. Appl. Artif. Intell. 133, 107974 (2024)

    Article  Google Scholar 

  13. Li, R., Gong, W., Lu, C., Wang, L.: A learning-based memetic algorithm for energy-efficient flexible job-shop scheduling with type-2 fuzzy processing time. IEEE Trans. Evol. Comput. 27(3), 610–620 (2023)

    Article  Google Scholar 

  14. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)

    Article  Google Scholar 

  15. Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Trans. Evol. Comput. 3(4), 257–271 (1999)

    Article  Google Scholar 

  16. Li, R., Gong, W., Wang, L., Lu, C., Dong, C.: Co-evolution with deep reinforcement learning for energy-aware distributed heterogeneous flexible job shop scheduling. IEEE Trans. Syst. Man Cybern. Syst. 54(1), 201–211 (2024)

    Google Scholar 

  17. Farias, L.R.C., Araujo, A.F.R.: IM-MOEA/D: an inverse modeling multi-objective evolutionary algorithm based on decomposition. In: 2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 462–467 (2021)

    Google Scholar 

  18. Li, R., Gong, W., Wang, L., Lu, C., Zhuang, X.: Surprisingly popular-based adaptive memetic algorithm for energy-efficient distributed flexible job shop scheduling. IEEE Trans. Cybern. 53(12), 8013–8023 (2023)

    Article  Google Scholar 

  19. Cao, S.J., Li, R., Gong, W.Y., Lu, C.: Inverse model and adaptive neighborhood search based cooperative optimizer for energy-efficient distributed flexible job shop scheduling. Swarm Evol. Comput. 83, 101419 (2023)

    Article  Google Scholar 

Download references

Acknowledgments

This work was financially supported by the National Natural Science Foundation of China under grant 62063021. It was also supported by the Key Program of National Natural Science Foundation of Gansu Province under Grant 23JRRA784, the High-level Foreign Experts Project of Gansu Province under Grant 22JR10KA007, and Lanzhou Science Bureau project (2018-rc-98), respectively.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fuqing Zhao .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhao, F., Li, M. (2024). Reinforcement Learning-Based Estimation of Distribution Algorithm for Energy-Efficient Distributed Heterogeneous Flexible Job Shop Scheduling Problem. In: Huang, DS., Zhang, X., Chen, W. (eds) Advanced Intelligent Computing Technology and Applications. ICIC 2024. Lecture Notes in Computer Science, vol 14862. Springer, Singapore. https://doi.org/10.1007/978-981-97-5578-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-981-97-5578-3_15

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-97-5577-6

  • Online ISBN: 978-981-97-5578-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics