Double Layer ACO Algorithm for the Multi-Objective FJSSP

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 differe...

Full description

Saved in:
Bibliographic Details
Published in:New generation computing 2008-08, Vol.26 (4), p.313-327
Main Authors: Xing, Li-Ning, Chen, Ying-Wu, Yang, Ke-Wei
Format: Article
Language:English
Subjects:
Artificial Intelligence
Computer Hardware
Computer Science
Computer Systems Organization and Communication Networks
Software Engineering/Programming and Operating Systems
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0288-3635
1882-7055
DOI:10.1007/s00354-008-0048-6