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

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 308; číslo 1; s. 76 - 83
Hlavní autori:	Justkowiak, Jan-Erik, Kovalev, Sergey, Kovalyov, Mikhail Y., Pesch, Erwin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.07.2023
Predmet:	Assignable due dates FPTAS Late work Scheduling Single machine Late work Scheduling Assignable due dates FPTAS Single machine
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!