Faster Minimization of Tardy Processing Time on a Single Machine

This paper is concerned with the 1 | | ∑ p j U j problem, the problem of minimizing the total processing time of tardy jobs on a single machine. This is not only a fundamental scheduling problem, but also an important problem from a theoretical point of view as it generalizes the Subset Sum problem...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 84; číslo 5; s. 1341 - 1356
Hlavní autori:	Bringmann, Karl, Fischer, Nick, Hermelin, Danny, Shabtay, Dvir, Wellnitz, Philip
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.05.2022 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Integers Knapsack problem Mathematics of Computing Multiplication Polynomials Run time (computers) Theory of Computation Tardy processing time min)-Convolution max Single machine scheduling Pseudo-polynomial time algorithm Fast polynomial multiplication
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!