A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration

This article addresses a two-stage, three-machine assembly scheduling problem that considers the learning effect. All jobs are processed on two machines in the first stage and move on to be processed on an assembly machine in the second stage. The objective of the study is to minimize the total comp...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Engineering optimization Jg. 52; H. 6; S. 1009 - 1036
Hauptverfasser:	Wu, Chin-Chia, Bai, Danyu, Azzouz, Ameni, Chung, I.-Hong, Cheng, Shuenn-Ren, Jhwueng, Dwueng-Chwuan, Lin, Win-Chin, Said, Lamjed Ben
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Abingdon Taylor & Francis 02.06.2020 Taylor & Francis Ltd
Schlagworte:	Algorithms Assembly machines Completion time Computer simulation genetic algorithm Genetic algorithms Greedy algorithms Heuristic methods Job shop scheduling Job shops Learning Lower bounds Simulated annealing Two-stage assembly
ISSN:	0305-215X, 1029-0273
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!