Exact exponential algorithms for 3-machine flowshop scheduling problems

In this paper, we focus on the design of an exact exponential time algorithm with a proved worst-case running time for 3-machine flowshop scheduling problems considering worst-case scenarios. For the minimization of the makespan criterion, a Dynamic Programming algorithm running in O ∗ ( 3 n ) is pr...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of scheduling Ročník 21; číslo 2; s. 227 - 233
Hlavní autori:	Shang, Lei, Lenté, Christophe, Liedloff, Mathieu, T’Kindt, Vincent
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.04.2018 Springer Nature B.V Springer Verlag
Predmet:	Algorithms Artificial Intelligence Business and Management Calculus of Variations and Optimal Control; Optimization Computational Complexity Computer Science Data Structures and Algorithms Dynamic programming Job shops Mathematics Operations Research Operations Research/Decision Theory Optimization Optimization and Control Production scheduling Run time (computers) Scheduling Supply Chain Management Moderately exponential algorithms Dynamic programming Flowshop Moderately exponential algorithms Dynamic programming Flowshop
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!