An iterated local search algorithm for distributed permutation flowshop group scheduling problems with total flowtime minimization

Distributed permutation flowshop group scheduling problem (DPFGSP) is studied in this paper. This problem can be regarded as a combination of the distributed flowshop scheduling and group scheduling. An improved iterated local search (dILS) algorithm is proposed to minimize the total flowtime. First...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Chinese Control Conference s. 2003 - 2008
Hlavní autori: Zhao, Hui, Liu, Yu-Fan, Pan, Quan-Ke, Li, Yuan-Zhen
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: Technical Committee on Control Theory, Chinese Association of Automation 26.07.2021
Predmet:
Benchmark testing
Distributed permutation flowshop group scheduling
Heuristic algorithms
Iterated local search
Minimization
Scheduling
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!
Popis
Shrnutí:Distributed permutation flowshop group scheduling problem (DPFGSP) is studied in this paper. This problem can be regarded as a combination of the distributed flowshop scheduling and group scheduling. An improved iterated local search (dILS) algorithm is proposed to minimize the total flowtime. First of all, we use a simple heuristic algorithm based on the famous NEH heuristics to generate an initial solution. Next, we use the solutions obtained from two different neighborhoods to perform an iterated local search. The acceptance criterion is the simulated-annealing type with a constant temperature. Finally, the propo dILS algorithm is compared with the existing VND algorithm based on the 810 benchmark instances. The experimental results show that the proposed dILS algorithm has significant advantages in solving the DPFGSP under consideration.
ISSN:1934-1768
DOI:10.23919/CCC52363.2021.9550063