Two-sided assembly line balancing problem of type I: Improvements, a simple algorithm and a comprehensive study

Many meta-heuristic methods have been applied to solve the two-sided assembly line balancing problem of type I with the objective of minimizing the number of stations, but some of them are very complex or intricate to be extended. In addition, different decoding schemes and different objectives have...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & operations research Jg. 79; S. 78 - 93
Hauptverfasser:	Li, Zixiang, Tang, Qiuhua, Zhang, LiPing
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Elsevier Ltd 01.03.2017 Pergamon Press Inc
Schlagworte:	Algorithms Assembly line balancing Assembly lines Heuristic Iterated greedy Local search Metaheuristics Studies Two-sided assembly line Two-sided assembly line Local search Assembly line balancing Iterated greedy Metaheuristics
ISSN:	0305-0548, 1873-765X, 0305-0548
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!