Iterated greedy with strategic reconstruction for parallel machine problem with weighted tardiness and setup times
Operational Research · 2026-12 · 26 (4)
DOI: 10.1007/s12351-026-01092-7 ↗Kurz gefasst
Fachartikel in der Zeitschrift Operational Research, online erschienen am 25.07.2026. Verfasst von Ahmed Missaoui und 1 weiteren Autor:innen. Die Arbeit nennt 38 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: University College Cork.
Abstract (Originalsprache)
On-time delivery is becoming increasingly crucial for industrial companies, due to their customers’ need for deliveries by specific dates. This paper investigates parallel machine scheduling problems with sequence-dependent setup times, a combinatorial challenge that has gained significant attention due to its practicality and relevance in real-world applications. Aiming to reduce total weighted tardiness, we introduce a mixed integer linear programming model and an effective iterated greedy approach with a strategic reconstruction operator. We evaluate the performance of our methods by comparing it with six well-established and related approaches. Our experiments, using a benchmark set of 900 instances, validate that the introduced iterated greedy algorithm consistently produces high-quality solutions.
Förderung
- University College Cork
Zitieren
APA
Missaoui, A., & O’Sullivan, B. (2026). Iterated greedy with strategic reconstruction for parallel machine problem with weighted tardiness and setup times. Operational Research, 26(4). https://doi.org/10.1007/s12351-026-01092-7
Vancouver
Missaoui A, O’Sullivan B. Iterated greedy with strategic reconstruction for parallel machine problem with weighted tardiness and setup times. Operational Research. 2026;26(4). doi:10.1007/s12351-026-01092-7
BibTeX
@article{Missaoui2026,
author = {Missaoui, Ahmed and O’Sullivan, Barry},
title = {Iterated greedy with strategic reconstruction for parallel machine problem with weighted tardiness and setup times},
journal = {Operational Research},
year = {2026},
volume = {26},
number = {4},
doi = {10.1007/s12351-026-01092-7}
}
EUVIMED