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...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 300; no. 2; pp. 504 - 511
Main Authors:	Chen, Xin, Miao, Qian, Lin, Bertrand M.T., Sterna, Malgorzata, Blazewicz, Jacek
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.07.2022
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!