New algorithms for minimizing the weighted number of tardy jobs on a single machine

In this paper we study the classical single machine scheduling problem where the objective is to minimize the weighted number of tardy jobs. Our analysis focuses on the case where one or more of three natural parameters is either constant or is taken as a parameter in the sense of parameterized comp...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Annals of operations research Ročník 298; číslo 1-2; s. 271 - 287
Hlavní autori:	Hermelin, Danny, Karhi, Shlomo, Pinedo, Michael, Shabtay, Dvir
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.03.2021 Springer Springer Nature B.V
Predmet:	Algorithms Business and Management Case studies Combinatorics Complexity theory Context switching Dynamic programming Intelligent devices Job shops Knapsack problem Management Moving averages Operations research Operations Research/Decision Theory Parameters Polynomials Production scheduling S.I.: CoDIT2017-Combinatorial Optimization Scheduling Simulated annealing (Mathematics) Studies Theory of Computation Israel New York United States > US Weighted number of tardy jobs NP-hard Fixed parametrized tractability Single machine scheduling Polynomial time algorithms
ISSN:	0254-5330, 1572-9338
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!