An exact algorithm for single-machine scheduling without machine idle time

This study proposes an exact algorithm for the general single-machine scheduling problem without machine idle time to minimize the total job completion cost. Our algorithm is based on the Successive Sublimation Dynamic Programming (SSDP) method. Its major drawback is heavy memory usage to store dyna...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of Scheduling Ročník 12; číslo 6; s. 575 - 593
Hlavní autori:	Tanaka, Shunji, Fujikuma, Shuji, Araki, Mituhiko
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Boston Springer Science and Business Media LLC 01.12.2009 Springer US Springer Nature B.V
Predmet:	Algorithms Artificial Intelligence Business and Management Calculus of Variations and Optimal Control; Optimization Dynamic programming Experiments Integer programming Operations Research/Decision Theory Optimization Production scheduling Scheduling Studies Supply Chain Management Single-machine scheduling Successive sublimation dynamic programming method Time-indexed formulation Exact algorithm Lagrangian relaxation
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!