Welcome to the InfoSci Platform
Reference Hub9
An Ant Colony System Algorithm for the Hybrid Flow-Shop Scheduling Problem

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

Safa Khalouli, Fatima Ghedjati, Abdelaziz Hamzaoui
Copyright: © 2011 |Volume: 2 |Issue: 1 |Pages: 15
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781613505670|DOI: 10.4018/jamc.2011010103
Cite Article Cite Article

MLA

Khalouli, Safa, et al. "An Ant Colony System Algorithm for the Hybrid Flow-Shop Scheduling Problem." IJAMC vol.2, no.1 2011: pp.29-43. http://doi.org/10.4018/jamc.2011010103

APA

Khalouli, S., Ghedjati, F., & Hamzaoui, A. (2011). An Ant Colony System Algorithm for the Hybrid Flow-Shop Scheduling Problem. International Journal of Applied Metaheuristic Computing (IJAMC), 2(1), 29-43. http://doi.org/10.4018/jamc.2011010103

Chicago

Khalouli, Safa, Fatima Ghedjati, and Abdelaziz Hamzaoui. "An Ant Colony System Algorithm for the Hybrid Flow-Shop Scheduling Problem," International Journal of Applied Metaheuristic Computing (IJAMC) 2, no.1: 29-43. http://doi.org/10.4018/jamc.2011010103

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.