A Reinforcement Learning-Variable Neighborhood Search Method for the Cloud Manufacturing Scheduling Robust Optimization Problem with Uncertain Service Time

DOI

10.2991/978-94-6463-256-9_54How to use a DOI?

Keywords

CMfg scheduling; robust optimization; non-predefined service paths; variable neighborhood search algorithm; upper confidence bounds algorithm; reinforcement learning

Abstract

Cloud manufacturing (CMfg) is an advanced networked intelligent manufacturing model, which includes a large number of new product customization services. Since many products lack historical data on service time, there is uncertainty about CMfg product service time, thus, CMfg service platforms need to perform robust scheduling of CMfg services for new products. In this paper, a CMfg scheduling model considering service time uncertainty and non-predefined service paths is constructed, and its robust equivalent is derived. In order to effectively solve the above model, this paper proposes a reinforcement learning-variable neighborhood search algorithm (rVNS) based on the variable neighborhood search algorithm, in which the upper confidence bound algorithm (UCB1) is used to adaptively select the neighborhood operator. To solve the problem of insufficient historical data at its cold start, the SARSA (lambda) method is used in this paper. In addition, this paper leverages adaptive windows to estimate and detect changes in rewards in data streams to obtain more accurate reward estimates. A large number of experiments prove that the algorithm designed in this paper has high accuracy and speed advantages in solving this problem.

Copyright

© 2024 The Author(s)

Open Access

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Download article (PDF)

TY  - CONF
AU  - Sihan Wang
AU  - Chengjun Ji
PY  - 2023
DA  - 2023/10/09
TI  - A Reinforcement Learning-Variable Neighborhood Search Method for the Cloud Manufacturing Scheduling Robust Optimization Problem with Uncertain Service Time
BT  - Proceedings of the 2023 4th International Conference on Management Science and Engineering Management (ICMSEM 2023)
PB  - Atlantis Press
SP  - 524
EP  - 533
SN  - 2352-5428
UR  - https://doi.org/10.2991/978-94-6463-256-9_54
DO  - 10.2991/978-94-6463-256-9_54
ID  - Wang2023
ER  -