Faster Minimization of Tardy Processing Time on a Single Machine

Bringmann, Karl; Fischer, Nick; Hermelin, Danny; Shabtay, Dvir; Wellnitz, Philip

doi:10.1007/s00453-022-00928-w

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_3367715_6

DetailsSummary

Released

Journal Article

Faster Minimization of Tardy Processing Time on a Single Machine

MPS-Authors

/persons/resource/persons44182

Bringmann, Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons242908

Fischer, Nick
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons229250

Wellnitz, Philip
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://rdcu.be/cG2A9
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Bringmann, K., Fischer, N., Hermelin, D., Shabtay, D., & Wellnitz, P. (2022). Faster Minimization of Tardy Processing Time on a Single Machine. Algorithmica, 84, 1341-1356. doi:10.1007/s00453-022-00928-w.

Cite as: https://hdl.handle.net/21.11116/0000-0009-FAD4-E

Abstract

There is no abstract available