Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
475962 | Computers & Operations Research | 2011 | 8 Pages |
Abstract
This paper deals with the scheduling problem of minimizing the makespan in a permutational flowshop environment with the possibility of outsourcing certain jobs. It addresses this problem by means of the development of an ant colony optimization-based algorithm. This new algorithm, here named as flowshop ant colony optimization is composed of two combined ACO heuristics. The results show that this new approach can be used to solve the problem efficiently and in a short computational time.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
R.F. Tavares Neto, M. Godinho Filho,