IDEAS home Printed from https://ideas.repec.org/a/spr/flsman/v36y2024i2d10.1007_s10696-023-09488-9.html
   My bibliography  Save this article

A tabu-based adaptive large neighborhood search for scheduling unrelated parallel batch processing machines with non-identical job sizes and dynamic job arrivals

Author

Listed:
  • Xin Xiao

    (Central South University)

  • Bin Ji

    (Central South University)

  • Samson S. Yu

    (Deakin University)

  • Guohua Wu

    (Central South University)

Abstract

In this study, we investigate an unrelated parallel batch processing machines scheduling problem (UPBPMSP). A set of jobs with non-identical sizes and arbitrary ready times are scheduled on unrelated parallel batch processing machines with different capacities to minimize the makespan (i.e., the completion time of the last batch). Existing studies have either decomposed the scheduling problem into two sub-problems and employed population-based heuristic interaction for searching the best solutions or used neighborhood search algorithms to search the current solution’s neighborhood to find a better solution. However, the performances of these methods are not quite satisfactory due to the complicated interactions or oversimplified neighborhood search strategies, especially for large-scale UPBPMSPs. In this study, we propose a novel tabu-based adaptive large neighborhood search (TALNS) algorithm to obtain high-quality solutions for the UPBPMSP. To avoid complex interactions, we propose a new solution structure, and the proposed TALNS is applied to obtain the optimal solution structure of the UPBPMSP. Extensive experiments are conducted to evaluate the performance of the proposed algorithm on a total of 360 instances from the literature and 30 new instances. Numerical results demonstrate that the proposed TALNS outperforms the neighborhood search methods, which outperforms the population-based methods. With the proposed TALNS, 55 out of 360 instances’ best-known solutions are updated from this study.

Suggested Citation

  • Xin Xiao & Bin Ji & Samson S. Yu & Guohua Wu, 2024. "A tabu-based adaptive large neighborhood search for scheduling unrelated parallel batch processing machines with non-identical job sizes and dynamic job arrivals," Flexible Services and Manufacturing Journal, Springer, vol. 36(2), pages 409-452, June.
  • Handle: RePEc:spr:flsman:v:36:y:2024:i:2:d:10.1007_s10696-023-09488-9
    DOI: 10.1007/s10696-023-09488-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10696-023-09488-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10696-023-09488-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:flsman:v:36:y:2024:i:2:d:10.1007_s10696-023-09488-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.