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

Xin Xiao, Bin Ji (), Samson S. Yu and Guohua Wu
Additional contact information
Xin Xiao: Central South University
Bin Ji: Central South University
Samson S. Yu: Deakin University
Guohua Wu: Central South University

Flexible Services and Manufacturing Journal, 2024, vol. 36, issue 2, No 2, 409-452

Abstract: 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.

Keywords: Unrelated parallel machines; Batch processing; Tabu; Adaptive large neighborhood search (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10696-023-09488-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:flsman:v:36:y:2024:i:2:d:10.1007_s10696-023-09488-9

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10696

DOI: 10.1007/s10696-023-09488-9

Access Statistics for this article

Flexible Services and Manufacturing Journal is currently edited by Hans Günther

More articles in Flexible Services and Manufacturing Journal from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().