Alternative algorithms for identical machines scheduling to maximize total early work with a common due date
[ 1 ] Instytut Informatyki, Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ P ] pracownik
2022
artykuł naukowy
angielski
- Identical machines scheduling
- Early work maximization
- Common due date
- Dynamic programming
- Fully polynomial time approximation scheme
EN We study a scheduling problem with a given number of identical parallel machines, a common job due date and the total early work criterion, i.e., P m|dj =d| max{X}, which is known to be NP-hard. A new dynamic programming algorithm is proposed, which is more efficient than the existing exact approach for this problem. Based on the proposed dynamic programming, we further design two new fully polynomial time approximation schemes. The effectiveness and efficiency of the new exact and pproximation approaches are validated in the computational experiments.
01.07.2022
108386-1 - 108386-9
Article Number: 108386
140
7,9