Single machine scheduling to maximize the number of on-time jobs with generalized due-dates

In scheduling problems with generalized due dates (gdd), the due dates are specified according to their position in the sequence, and the j -th due date is assigned to the job in the j -th position. We study a single-machine problem with generalized due dates, where the objective is maximizing the n...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of scheduling Ročník 23; číslo 3; s. 289 - 299
Hlavní autoři:	Gerstl, Enrique, Mosheiov, Gur
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.06.2020 Springer Nature B.V
Témata:	Algorithms Artificial Intelligence Business and Management Calculus of Variations and Optimal Control; Optimization Dynamic programming Integer programming Job shops Operations Research/Decision Theory Optimization Polynomials Scheduling Supply Chain Management NP-hardness Scheduling Generalized due dates Branch-and-bound algorithm Single machine Heuristic
ISSN:	1094-6136, 1099-1425
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!