Exact Approaches to Late Work Scheduling on Unrelated Machines

Exact Approaches to Late Work Scheduling on Unrelated Machines

We consider the scheduling problem on unrelated parallel machines in order to minimize the total late work. Since the problem is NP-hard, we propose a mathematical model and two dedicated exact approaches for solving it, based on the branching and bounding strategy and on enumerating combined with a...

Celý popis

Podrobná bibliografie
Hlavní autoři: Liu Xinbo, Wang Wen, Chen Xin, Sterna Malgorzata, Blazewicz Jacek
Médium: Článek
Jazyk:English
Vydáno: Sciendo 2023-06-01
Edice:International Journal of Applied Mathematics and Computer Science
Témata:
late work scheduling
unrelated machines
mathematical model
branch-and-bound algorithm
dynamic programming
On-line přístup:https://doi.org/10.34768/amcs-2023-0021

Internet

https://doi.org/10.34768/amcs-2023-0021

Podobné jednotky