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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computers & industrial engineering Ročník 139; s. 105984
Hlavní autori: Lei, Chuanjin, Zhao, Ning, Ye, Song, Wu, Xiuli
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Ltd 01.01.2020
Predmet:
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
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:•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 flow shop scheduling problem in smart manufacturing system. In this problem, jobs need to be transported by transporters like AGV (Automated Guided Vehicle) to next stage after processing. During transportation, waiting time dynamically occurs for both jobs and transporters, and finally contributes to makespan. The waiting times are conditioned by buffer capacity, machine allocations and production sequence. In order to minimize makespan with consideration of dynamic waiting times, we proposed a waiting time calculation approach to evaluate waiting time and makespan. This approach considers two situations: infinite buffer capacity and zero buffer capacity. Further, we developed a memetic algorithm integrated with waiting time calculation approach to solve FFSPDW. Finally, we verified the algorithm parameters via analysis of variance. Computational results show that the proposed memetic algorithm is able to reach high quality solutions with short computation time. Consequently, the proposed approach is suitable for solving industrial FFSPDW problems.
ISSN:0360-8352
1879-0550
DOI:10.1016/j.cie.2019.07.041