Author
Listed:
- Zhangying Xu
(Macau Institute of Systems Engineering, Macau University of Science and Technology, Macao 999078, China
Macau University of Science and Technology Zhuhai MUST Science and Technology Research Institute, Zhuhai 519031, China)
- Qi Jia
(Macau Institute of Systems Engineering, Macau University of Science and Technology, Macao 999078, China
Macau University of Science and Technology Zhuhai MUST Science and Technology Research Institute, Zhuhai 519031, China)
- Kaizhou Gao
(Macau Institute of Systems Engineering, Macau University of Science and Technology, Macao 999078, China
Macau University of Science and Technology Zhuhai MUST Science and Technology Research Institute, Zhuhai 519031, China)
- Yaping Fu
(School of Business, Qingdao University, Qingdao 266071, China)
- Li Yin
(Macau Institute of Systems Engineering, Macau University of Science and Technology, Macao 999078, China
Macau University of Science and Technology Zhuhai MUST Science and Technology Research Institute, Zhuhai 519031, China)
- Qiangqiang Sun
(School of Information Engineering, Shandong University of Aeronautics, Binzhou 256603, China)
Abstract
This study investigates the integrated multi-objective scheduling problems of job shops and material handling robots (MHR) with minimising the maximum completion time (makespan), earliness or tardiness, and total energy consumption. The collaborative scheduling of MHR and machines can enhance efficiency and reduce costs. First, a mathematical model is constructed to articulate the concerned problems. Second, three meta-heuristics, i.e., genetic algorithm (GA), differential evolution, and harmony search, are employed, and their variants with seven local search operators are devised to enhance solution quality. Then, reinforcement learning algorithms, i.e., Q-learning and state–action–reward–state–action (SARSA), are utilised to select suitable local search operators during iterations. Three reward setting strategies are designed for reinforcement learning algorithms. Finally, the proposed algorithms are examined by solving 82 benchmark instances. Based on the solutions and their analysis, we conclude that the proposed GA integrating SARSA with the first reward setting strategy is the most competitive one among 27 compared algorithms.
Suggested Citation
Zhangying Xu & Qi Jia & Kaizhou Gao & Yaping Fu & Li Yin & Qiangqiang Sun, 2024.
"Integrated Scheduling of Multi-Objective Job Shops and Material Handling Robots with Reinforcement Learning Guided Meta-Heuristics,"
Mathematics, MDPI, vol. 13(1), pages 1-28, December.
Handle:
RePEc:gam:jmathe:v:13:y:2024:i:1:p:102-:d:1556195
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2024:i:1:p:102-:d:1556195. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.