Harmony search algorithm with dynamic subpopulations for scheduling identical parallel machines

In this paper, we study the identical parallel machines scheduling problem for minimizing the makespan. A novel harmony search (HS) algorithm with dynamic subpopulations is proposed to tackle this problem. First, an encoding scheme based on random key representation and list schedule rule is develop...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2010 Sixth International Conference on Natural Computation Ročník 5; s. 2369 - 2373
Hlavní autori: Jing Chen, Quan-Ke Pan, Huan Li
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.08.2010
Predmet:
combinatorial optimization
Dynamic scheduling
harmony search
Heuristic algorithms
makespan
Optimization
Parallel machines
Processor scheduling
Schedules
scheduling
ISBN:1424459583, 9781424459582
ISSN:2157-9555
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, we study the identical parallel machines scheduling problem for minimizing the makespan. A novel harmony search (HS) algorithm with dynamic subpopulations is proposed to tackle this problem. First, an encoding scheme based on random key representation and list schedule rule is developed, which constructs a mapping scheme between the real-valued harmony vectors and job assignments. Second, the whole harmony memory is divided into many small-sized subpopulations. Each subpopulation performs evolution independently and exchanges information with the other subpopulations periodically by using a regrouping schedule. Moreover, a novel improvisation process is applied to generate new harmonies by making use of the information of the local best harmony in each subpopulation. Simulation results demonstrate that the proposed HS algorithm is more effective when compared with the other two heuristics.
ISBN:1424459583
9781424459582
ISSN:2157-9555
DOI:10.1109/ICNC.2010.5584549