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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of scheduling Jg. 21; H. 2; S. 227 - 233
Hauptverfasser:	Shang, Lei, Lenté, Christophe, Liedloff, Mathieu, T’Kindt, Vincent
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.04.2018 Springer Nature B.V Springer Verlag
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!