Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date

•Fully polynomial time approximation scheme for early work maximization is proposed.•The new FPTAS dominates PTAS for the two-machine case known from the literature.•Complexity of parallel machine scheduling problems with common due date is studied.•Theoretical studies are completed with computation...

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 284; číslo 1; s. 67 - 74
Hlavní autori:	Chen, Xin, Liang, Yage, Sterna, Małgorzata, Wang, Wen, Błażewicz, Jacek
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.07.2020
Predmet:	Early work Fully polynomial time approximation scheme Late work Parallel identical machines Scheduling Fully polynomial time approximation scheme Late work Scheduling Early work Parallel identical machines
ISSN:	0377-2217, 1872-6860
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!