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

Celý popis

Podrobná bibliografie

Vydáno v:	Engineering optimization Ročník 52; číslo 6; s. 1009 - 1036
Hlavní autoři:	Wu, Chin-Chia, Bai, Danyu, Azzouz, Ameni, Chung, I.-Hong, Cheng, Shuenn-Ren, Jhwueng, Dwueng-Chwuan, Lin, Win-Chin, Said, Lamjed Ben
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Abingdon Taylor & Francis 02.06.2020 Taylor & Francis Ltd
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!