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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of scheduling Ročník 26; číslo 2; s. 193 - 207
Hlavní autori:	Atsmony, Matan, Mosheiov, Gur
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.04.2023 Springer Nature B.V
Predmet:	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
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!