Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection

We study a scheduling problem on parallel identical machines, where the objective function is maximizing the weighted number of jobs completed exactly at their due-dates. The scheduler may reject a subset of the jobs, and the total permitted rejection cost is assumed to be bounded. Thus, when a deci...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of scheduling Jg. 26; H. 2; S. 193 - 207
Hauptverfasser:	Atsmony, Matan, Mosheiov, Gur
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.04.2023 Springer Nature B.V
Schlagworte:	Algorithms Artificial Intelligence Business and Management Calculus of Variations and Optimal Control; Optimization Dynamic programming Operations Research/Decision Theory Optimization Polynomials Rejection Run time (computers) Scheduling Supply Chain Management Scheduling Job-rejection Dynamic programming Just-in-time Parallel identical machines
ISSN:	1094-6136, 1099-1425
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!