A discrete particle swarm optimization algorithm for scheduling parallel machines

Authors:
Ali Husseinzadeh Kashan;Behrooz Karimi
Affiliations:
Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, P.O. Box 15875-4413, Tehran, Iran;Department of Industrial Engineering, Amirkabir University of Technology, 424 Hafez Avenue, P.O. Box 15875-4413, Tehran, Iran
Venue:
Computers and Industrial Engineering
Year:
2009

Citing 5
Cited 12

Multiprocessor scheduling: combining LPT and MULTIFIT

Discrete Applied Mathematics
Particle swarm optimization for integer programming

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes

Computers and Operations Research
An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers

Computers and Operations Research
A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem

Computers and Operations Research

PSO Combined with ILS for Flowshop-Based Parallel Task Assignment Problem

ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence
Optimizing material procurement planning problem by two-stage fuzzy programming

Computers and Industrial Engineering
Combined discrete particle swarm optimization and simulated annealing for grid computing scheduling problem

ICIC'09 Proceedings of the Intelligent computing 5th international conference on Emerging intelligent computing technology and applications
A real-integer-discrete-coded particle swarm optimization for design problems

Applied Soft Computing
Sequential metamodelling with genetic programming and particle swarms

Winter Simulation Conference
Heuristic algorithms for assigning and scheduling flight missions in a military aviation unit

Computers and Industrial Engineering
A hybrid meta-heuristic algorithm for optimization of crew scheduling

Applied Soft Computing
Parallel-machine scheduling to minimize tardiness penalty and power cost

Computers and Industrial Engineering
A novel particle swarm optimisation approach to detecting continuous, thin and smooth edges in noisy images

Information Sciences: an International Journal
A particle swarm optimizer for grouping problems

Information Sciences: an International Journal
Minimizing resource consumption on uniform parallel machines with a bound on makespan

Computers and Operations Research
Software Survey: Distributed job scheduling based on Swarm Intelligence: A survey

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

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"m"a"x) 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.