Bi-Objective Integrated Scheduling of Job Shop Problems and Material Handling Robots with Setup Time
Runze Liu,
Qi Jia,
Hui Yu,
Kaizhou Gao (),
Yaping Fu () and
Li Yin
Additional contact information
Runze Liu: Macau Institute of Systems Engineering, Macau University of Science and Technology, Macao 999078, China
Qi Jia: Macau Institute of Systems Engineering, Macau University of Science and Technology, Macao 999078, China
Hui Yu: Macau Institute of Systems Engineering, Macau University of Science and Technology, Macao 999078, China
Kaizhou Gao: Macau Institute of Systems Engineering, Macau University of Science and Technology, Macao 999078, 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
Mathematics, 2025, vol. 13, issue 3, 1-33
Abstract:
This work investigates the bi-objective integrated scheduling of job shop problems and material handling robots with setup time. The objective is to minimize the maximum completion time and the mean of earliness and tardiness simultaneously. First, a mathematical model is established to describe the problems. Then, different meta-heuristics and their variants are developed to solve the problems, including genetic algorithms, particle swarm optimization, and artificial bee colonies. To improve the performance of algorithms, seven local search operators are proposed. Moreover, two reinforcement learning algorithms, Q-learning and SARSA, are designed to help the algorithm select appropriate local search operators during iterations, further improving the convergence of algorithms. Finally, based on 82 benchmark cases with different scales, the effectiveness of the suggested algorithms is evaluated by comprehensive numerical experiments. The experimental results and discussions show that the genetic algorithm with SARSA is more competitive than its peers.
Keywords: job shop scheduling; material handling robot; multi-objective optimization; reinforcement learning; meta-heuristics (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
https://www.mdpi.com/2227-7390/13/3/447/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/3/447/ (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:3:p:447-:d:1579350
Access Statistics for this article
Mathematics is currently edited by Ms. Emma He
More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().