A discrete particle swarm optimization algorithm for scheduling parallel machines

As a novel evolutionary technique, particle swarm optimization ( PSO) has received increasing attention and wide applications in a variety of fields. To our knowledge this paper investigates the first application of PSO algorithm to tackle the parallel machines scheduling problem. Proposing equation...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & industrial engineering Jg. 56; H. 1; S. 216 - 223
Hauptverfasser: Kashan, Ali Husseinzadeh, Karimi, Behrooz
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Elsevier Ltd 01.02.2009
Pergamon Press Inc
Schlagworte:
Algorithms
Heuristic
Makespan
Optimization algorithms
Parallel machines
Particle swarm optimization
Production scheduling
Scheduling
Studies
Parallel machines
Scheduling
Makespan
Particle swarm optimization
ISSN:0360-8352, 1879-0550
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:As a novel evolutionary technique, particle swarm optimization ( PSO) has received increasing attention and wide applications in a variety of fields. To our knowledge this paper investigates the first application of PSO algorithm to tackle the parallel machines scheduling problem. Proposing equations analogous to those of the classical PSO equations, we present a discrete PSO algorithm ( DPSO) to minimize makespan ( C max) criterion. We also investigate the effectiveness of DPSO algorithm through hybridizing it with an efficient local search heuristic. To verify the performance of DPSO algorithm and its hybridized version ( HDPSO), comparisons are made through using a recently proposed simulated annealing algorithm for the problem, addressed in the literature, as a comparator algorithm. Computational results signify that the proposed DPSO algorithm is very competitive and can be rapidly guided when hybridizing with a local search heuristic.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0360-8352
1879-0550
DOI:10.1016/j.cie.2008.05.007