Two-machine flow shop scheduling with a common due date to maximize total early work

•Two-machine ow shop scheduling to maximize total early work is considered.•A dynamic programming approach running in O(n2d2) time is proposed.•A fully polynomial time approximation scheme (FPTAS) is developed.•The approximation results work for the weighted model - if a specific constraint is satis...

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 300; číslo 2; s. 504 - 511
Hlavní autori:	Chen, Xin, Miao, Qian, Lin, Bertrand M.T., Sterna, Malgorzata, Blazewicz, Jacek
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 16.07.2022
Predmet:	Combinatorial optimization Dynamic programming Early and late work Flow shop scheduling FPTAS Early and late work Dynamic programming Combinatorial optimization FPTAS Flow shop scheduling
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!