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

Full description

Bibliographic Details

Published in:	Computers & industrial engineering Vol. 139; p. 105984
Main Authors:	Lei, Chuanjin, Zhao, Ning, Ye, Song, Wu, Xiuli
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.01.2020
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!