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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Annals of operations research Jg. 298; H. 1-2; S. 271 - 287
Hauptverfasser:	Hermelin, Danny, Karhi, Shlomo, Pinedo, Michael, Shabtay, Dvir
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.03.2021 Springer Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!