Alternative algorithms for identical machines scheduling to maximize total early work with a common due date

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., Pm|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 fo...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & industrial engineering Ročník 171; s. 108386
Hlavní autoři:	Chen, Xin, Shen, Xuefeng, Kovalyov, Mikhail Y., Sterna, Malgorzata, Blazewicz, Jacek
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.09.2022
Témata:	Common due date Dynamic programming Early work maximization Fully polynomial time approximation scheme Identical machines scheduling Fully polynomial time approximation scheme Early work maximization Common due date Dynamic programming Identical machines scheduling
ISSN:	0360-8352, 1879-0550
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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., Pm\|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 approximation approaches are validated in the computational experiments. •New dynamic programming algorithm with lower complexity is proposed for Pm\|dj=d\|max{X}.•Two new FPTASes are designed based on this algorithm.•Practical efficiency of the methods is validated in computational experiments.
ISSN:	0360-8352 1879-0550
DOI:	10.1016/j.cie.2022.108386