An Ant Colony System Algorithm for the Hybrid Flow-Shop Scheduling Problem

Authors:
Safa Khalouli;Fatima Ghedjati;Abdelaziz Hamzaoui
Affiliations:
University of Reims Champagne-Ardenne, France;University of Reims Champagne-Ardenne, France;University of Reims Champagne-Ardenne, France
Venue:
International Journal of Applied Metaheuristic Computing
Year:
2011

Citing 8
Cited 1

Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem

Management Science
An evaluation of sequencing heuristics in flow shops with multiple processors

Computers and Industrial Engineering
Hybrid flow shop scheduling: a survey

Computers and Industrial Engineering
Scheduling in Computer and Manufacturing Systems

Scheduling in Computer and Manufacturing Systems
A new approach to solve hybrid flow shop scheduling problems by artificial immune system

Future Generation Computer Systems - Special issue: Computational science of lattice Boltzmann modelling
Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
A multi-objective ant colony system algorithm for flow shop scheduling problem

Expert Systems with Applications: An International Journal
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Theoretical Analysis on Powers-of-Two Applied to JSP: A Case Study of Turbine Manufacturing

International Journal of Green Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

An integrated ant colony optimization algorithm (IACS-HFS) is proposed for a multistage hybrid flow-shop scheduling problem. The objective of scheduling is the minimization of the makespan. To solve this NP-hard problem, the IACS-HFS considers the assignment and sequencing sub-problems simultaneously in the construction procedures. The performance of the algorithm is evaluated by numerical experiments on benchmark problems taken from the literature. The results show that the proposed ant colony optimization algorithm gives promising and good results and outperforms some current approaches in the quality of schedules.