IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i3p447-d1579350.html
   My bibliography  Save this article

Bi-Objective Integrated Scheduling of Job Shop Problems and Material Handling Robots with Setup Time

Author

Listed:
  • Runze Liu

    (Macau Institute of Systems Engineering, Macau University of Science and Technology, Macao 999078, China
    Zhuhai MUST Science and Technology Research Institute, Macau University of Science and Technology, Zhuhai 519031, China)

  • Qi Jia

    (Macau Institute of Systems Engineering, Macau University of Science and Technology, Macao 999078, China
    Zhuhai MUST Science and Technology Research Institute, Macau University of Science and Technology, Zhuhai 519031, China)

  • Hui Yu

    (Macau Institute of Systems Engineering, Macau University of Science and Technology, Macao 999078, China
    Zhuhai MUST Science and Technology Research Institute, Macau University of Science and Technology, Zhuhai 519031, China)

  • Kaizhou Gao

    (Macau Institute of Systems Engineering, Macau University of Science and Technology, Macao 999078, China
    Zhuhai MUST Science and Technology Research Institute, Macau University of Science and Technology, 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
    Zhuhai MUST Science and Technology Research Institute, Macau University of Science and Technology, Zhuhai 519031, China)

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.

Suggested Citation

  • Runze Liu & Qi Jia & Hui Yu & Kaizhou Gao & Yaping Fu & Li Yin, 2025. "Bi-Objective Integrated Scheduling of Job Shop Problems and Material Handling Robots with Setup Time," Mathematics, MDPI, vol. 13(3), pages 1-33, January.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:3:p:447-:d:1579350
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/3/447/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/3/447/
    Download Restriction: no
    ---><---

    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:2025:i:3:p:447-:d:1579350. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.