Optimally rescheduling jobs with a Last-In-First-Out buffer

This paper considers single-machine scheduling problems in which a given solution, i.e., an ordered set of jobs, has to be improved as much as possible by re-sequencing the jobs. The need for rescheduling may arise in different contexts, e.g., due to changes in the job data or because of the local o...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of scheduling Ročník 24; číslo 6; s. 663 - 680
Hlavní autoři:	Nicosia, Gaia, Pacifici, Andrea, Pferschy, Ulrich, Resch, Julia, Righini, Giovanni
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.12.2021 Springer Nature B.V
Témata:	Algorithms Artificial Intelligence Buffers Business and Management Calculus of Variations and Optimal Control; Optimization Completion time Dynamic programming Job shops Lateness Operations Research/Decision Theory Optimization Polynomials Rescheduling Supply Chain Management Supply chains Dynamic programming algorithms Scheduling Rescheduling Supply chain sustainability Sequence coordination Complexity
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!