Exact approaches to late work scheduling on unrelated machines
[ 1 ] Instytut Informatyki, Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ P ] pracownik
2023
artykuł naukowy
angielski
- late work scheduling
- unrelated machines
- mathematical model
- branch-and-bound algorithm
- dynamic programming
EN 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 dynamic programming algorithm. The time effi- ciencies of all three approaches are evaluated through computational experiments.
285 - 295
CC BY-NC-ND (uznanie autorstwa - użycie niekomercyjne - bez utworów zależnych)
otwarte czasopismo
ostateczna wersja opublikowana
w momencie opublikowania
140
1,9 [Lista 2022]