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

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 284; no. 1; pp. 67 - 74
Main Authors:	Chen, Xin, Liang, Yage, Sterna, Małgorzata, Wang, Wen, Błażewicz, Jacek
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.07.2020
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!