Name
Abstract | ||
|---|---|---|
Scheduling for the flexible job shop is very important in both fields of production management and combinatorial optimization.
In this work, a double layer Ant Colony Optimization (ACO) algorithm is proposed for the Flexible Job Shop Scheduling Problem
(FJSSP). In the proposed algorithm, two different ACO algorithms are applied to solve the FJSSP with a hierarchical way. The
primary mission of upper layer ACO algorithm is achieving an excellent assignment of operations to machines. The leading task
of lower layer ACO algorithm is obtaining the optimal sequencing of operations on each machine. Experimental results suggest
that the proposed algorithm is a feasible and effective approach for the multi-objective FJSSP. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s00354-008-0048-6 | New Generation Comput. |
Keywords | Field | DocType |
Combinatorial Optimization,Ant Colony Optimization,Multi-Objective Optimization,Flexible Job Shop Scheduling,Scheduling Knowledge | Production manager,Ant colony optimization algorithms,Mathematical optimization,Job shop scheduling,Computer science,Scheduling (computing),Job shop,Flow shop scheduling,Algorithm,Multi-objective optimization,Combinatorial optimization | Journal |
Volume | Issue | ISSN |
26 | 4 | 0288-3635 |
Citations | PageRank | References |
4 | 0.42 | 20 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Li-ning Xing | 1 | 229 | 21.43 |
| Ying-wu Chen | 2 | 227 | 16.61 |
| Ke-wei Yang | 3 | 193 | 22.65 |