1. Ant colony optimization technique for the sequence-dependent flowshop scheduling problem.
- Author
-
Mirabi, Mohammad
- Subjects
MATHEMATICAL optimization ,PRODUCTION scheduling ,PERMUTATIONS ,ALGORITHMS ,HEURISTIC ,MATHEMATICAL sequences ,PROBABILITY theory - Abstract
In the real world, production scheduling systems, usually optimal job scheduling, requires an explicit consideration of sequence-dependent setup times. One of the most important scheduling criteria in practical systems is makespan. In this paper, the author presents an ant colony optimization (ACO) algorithm for the sequence-dependent permutation flowshop scheduling problem. The proposed ACO algorithm benefits from a new approach for computing the initial pheromone values and a local search. The proposed algorithm is tested on randomly generated problem instances and results indicate that it is very competitive with the existing best metaheuristics. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF