An imperialist competitive algorithm for a bi-objective parallel machine scheduling problem with load balancing consideration

An imperialist competitive algorithm for a bi-objective parallel machine scheduling problem with load balancing consideration

In this paper, we present a new Imperialist Competitive Algorithm (ICA) to solve a bi-objective scheduling of parallel-unrelated machines where setup times are sequence dependent. The objectives include mean completion tasks and mean squares of deviations from machines workload from their averages....

Full description

Bibliographic Details
Main Authors: Mansooreh Madani-Isfahani, Ehsan Ghobadian, Hassan Irani Tekmehdash, Reza Tavakkoli-Moghaddam, Mahdi Naderi-Beni
Format: Article
Language:English
Published: Growing Science 2013-04-01
Series:International Journal of Industrial Engineering Computations
Subjects:
Parallel machine scheduling
Genetic algorithm
Imperialist competitive algorithm
Load Balancing
Particle swarm optimization
Online Access:http://www.growingscience.com/ijiec/Vol4/IJIEC_2013_7.pdf

Internet

http://www.growingscience.com/ijiec/Vol4/IJIEC_2013_7.pdf

Similar Items