An Artificial Bee Colony Algorithm for the Unrelated Parallel Machines Scheduling Problem
In this work, we tackle the problem of scheduling a set of jobs on a set of non-identical parallel machines with the goal of minimising the total weighted completion times. Artificial bee colony (ABC) algorithm is a new optimization technique inspired by the intelligent foraging behaviour of honey-bee swarm. These algorithms have shown a better or similar performance to those of other population-based algorithms, with the advantage of employing fewer control parameters. This paper proposes an ABC algorithm that combines the basic scheme with two significant elements: (1) a local search method to enhance the exploitation capability of basic ABC and (2) a neighbourhood operator based on iterated greedy constructive-destructive procedure. The benefits of the proposal in comparison to three different metaheuristic proposed in the literature are experimentally shown.
Keywordsdiscrete optimisation metaheuristics artificial bee colony unrelated parallel machines schedulling problem
Unable to display preview. Download preview PDF.
- 12.Azizoglu, M., Kirca, O.: Scheduling jobs on unrelated parallel machines to minimize regular total cost functions. IIE Transactions 31(2), 153–159 (1999)Google Scholar
- 25.Zaidi, M., Jarboui, B., Loukil, T., Kacem, I.: Hybrid meta-heuristics for uniform parallel machine to minimize total weighted completion time. In: Proc. of 8th International Conference of Modeling and Simulation, MOSIM 2010 (2010)Google Scholar