An iterated local search algorithm for distributed assembly permutation flowshop problem

Nowadays, the distributed assembly permutation flowshop problem (DAPFSP) has important applications in practice. In this paper, we propose a group iterated local search (gILS) algorithm to solve the problem with total flowtime (TF) criterion. We use the heuristic method based on a ascending order, w...

Celý popis

Podrobná bibliografia

Vydané v:	Chinese Control Conference s. 1548 - 1552
Hlavní autori:	Huang, Ying-Ying, Pan, Quan-ke, Hu, XiaoLu, Tasgetiren, M Fatih, Huang, Jiang-ping
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	Technical Committee on Control Theory, Chinese Association of Automation 01.07.2020
Predmet:	Assembly line scheduling Distributed flowshop scheduling Heuristic algorithms Iterated local search Optimization Perturbation methods Production facilities Search problems Total flowtime
ISSN:	1934-1768
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!