Ant colony optimization technique for the sequence-dependent flowshop scheduling problem |
| |
Authors: | Mohammad Mirabi |
| |
Affiliation: | 1. Department of Industrial Engineering, Islamic Azad University, Ashkezar Branch, Yazd, Iran
|
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|