A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates

We consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop problem subject to release dates. We derive several lower bounds as well as a branch-and-bound algorithm for the problem under consideration. Computational experiments, on a large set of randomly...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Operational research Jg. 20; H. 1; S. 21 - 35
Hauptverfasser:	Rakrouki, Mohamed Ali, Kooli, Anis, Chalghoumi, Sabrine, Ladhari, Talel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2020 Springer Nature B.V
Schlagworte:	Algorithms Business and Management Completion time Computational Intelligence Job shops Lower bounds Management Science Operations Research Operations Research/Decision Theory Original Paper Permutations Production scheduling Release dates Branch-and-bound Flowshop Release dates Total completion time
ISSN:	1109-2858, 1866-1505
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!