Single machine scheduling with assignable due dates to minimize maximum and total late work

•Two problems of minimizing maximum late work and total late work in single machine scheduling are considered where due dates are assignable.•The problems have multiple applications in production and logistics.•The first problem is solved efficiently.•Two pseudo-polynomial dynamic programming algori...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 308; no. 1; pp. 76 - 83
Main Authors:	Justkowiak, Jan-Erik, Kovalev, Sergey, Kovalyov, Mikhail Y., Pesch, Erwin
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.07.2023
Subjects:	Assignable due dates FPTAS Late work Scheduling Single machine Late work Scheduling Assignable due dates FPTAS Single machine
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!