Memetic algorithm for solving flexible flow-shop scheduling problems with dynamic transport waiting times

•Developed dynamic waiting time calculation approach (DWC).•Developed machine selection heuristics.•Proposed memetic framework that integrate iterated greedy (IG) algorithm with machine selection heuristics. Flexible flow-shop scheduling with dynamic transport waiting times (FFSPDW) is a typical flo...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & industrial engineering Jg. 139; S. 105984
Hauptverfasser:	Lei, Chuanjin, Zhao, Ning, Ye, Song, Wu, Xiuli
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.01.2020
Schlagworte:	Dynamic waiting times Flexible flow-shop scheduling Integrated scheduling Iterated greedy algorithm Makespan Flexible flow-shop scheduling Integrated scheduling Iterated greedy algorithm Makespan Dynamic waiting times
ISSN:	0360-8352, 1879-0550
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!