Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method

Authors:
Andrea Rossi;Gino Dini
Affiliations:
Department of Mechanical, Nuclear and Production Engineering, University of Pisa, Via Bonanno Pisano 25/B, 56126 Pisa, Italy;Department of Mechanical, Nuclear and Production Engineering, University of Pisa, Via Bonanno Pisano 25/B, 56126 Pisa, Italy
Venue:
Robotics and Computer-Integrated Manufacturing
Year:
2007

Citing 6
Cited 13

Job-shop scheduling with multi-purpose machines

Computing
A fast taboo search algorithm for the job shop problem

Management Science
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling

Management Science
Two-machine flowshop group scheduling problem

Computers and Operations Research
MAX-MIN Ant system

Future Generation Computer Systems
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Ant Colony Optimization for the Single Machine Total Earliness Tardiness Scheduling Problem

IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
A hybrid heuristic to solve the parallel machines job-shop scheduling problem

Advances in Engineering Software
A virtual layout system integrated with polar coordinates-based genetic algorithm

International Journal of Computer Applications in Technology
A particle swarm optimization algorithm for flexible jobshop scheduling problem

CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
Ant colony optimization algorithm for reactive production scheduling problem in the job shop system

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm

Information Sciences: an International Journal
A two-stage hybrid particle swarm optimization algorithm for the stochastic job shop scheduling problem

Knowledge-Based Systems
Co-evolutionary genetic algorithm for fuzzy flexible job shop scheduling

Applied Soft Computing
Iterative flattening search for the flexible job shop scheduling problem

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
An improved ant colony optimization for scheduling identical parallel batching machines with arbitrary job sizes

Applied Soft Computing
Application of ant colony optimization algorithm in process planning optimization

Journal of Intelligent Manufacturing
A hybrid differential evolution algorithm for job shop scheduling problems with expected total tardiness criterion

Applied Soft Computing
Scheduling flow lines with buffers by ant colony digraph

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes an ant colony optimisation-based software system for solving FMS scheduling in a job-shop environment with routing flexibility, sequence-dependent setup and transportation time. In particular, the optimisation problem for a real environment, including parallel machines and operation lag times, has been approached by means of an effective pheromone trail coding and tailored ant colony operators for improving solution quality. The method used to tune the system parameters is also described. The algorithm has been tested by using standard benchmarks and problems, properly designed for a typical FMS layout. The effectiveness of the proposed system has been verified in comparison with alternative approaches.