Ant colony optimization for solving a bi-criteria hybrid flow shop problem

2008 ◽  
Author(s):  
Safa Khalouli ◽  
Fatima Ghedjati ◽  
Abdelaziz Hamzaoui
Keyword(s):  
Ant Colony Optimization ◽  
Flow Shop ◽  
Ant Colony ◽  
Hybrid Flow Shop ◽  
Flow Shop Problem

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

2012 ◽  
pp. 85-98
Author(s):  
Safa Khalouli ◽  
Fatima Ghedjati ◽  
Abdelaziz Hamzaoui
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Flow Shop ◽  
Ant Colony ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Scheduling Problem ◽  
Ant Colony Optimization Algorithm ◽  
Shop Scheduling ◽  
Hybrid Flow Shop Scheduling

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.

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

2011 ◽  
Vol 2 (1) ◽  
pp. 29-43 ◽  
Author(s):  
Safa Khalouli ◽  
Fatima Ghedjati ◽  
Abdelaziz Hamzaoui
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Flow Shop ◽  
Ant Colony ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Scheduling Problem ◽  
Ant Colony Optimization Algorithm ◽  
Shop Scheduling ◽  
Hybrid Flow Shop Scheduling

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.

An Ant Colony Optimization Algorithm for the Press Shop Scheduling Problem

2013 ◽  
Vol 321-324 ◽  
pp. 2116-2121
Author(s):  
Ji Ung Sun
Keyword(s):  
Ant Colony Optimization ◽  
Flow Shop ◽  
Real Life ◽  
Ant Colony ◽  
Scheduling Problem ◽  
Ant Colony Optimization Algorithm ◽  
The Press ◽  
Flow Shop Problem ◽  
Press Shop ◽  
Dependent Setup Times

This paper deals with a real-life two machine scheduling problem for the side frame press shop in a truck manufacturing company. The shop consists of two machines where only the first machine, press machine, has separable, external and sequence dependent setup times. Moreover all the jobs require processing by the press machine more than once in their operation sequences with re-entrant work flows. Redefining the job elements, the problem is transformed into a general two machine flow shop problem which has a set of job-element precedence constraints. To solve the problem, an ant colony optimization (ACO) algorithm with the objective of the minimum makespan is developed. We investigate performance of the proposed ACO algorithm through the comparative study. Experiment results show that the proposed algorithm is more effective than existing method for the problem.

Solving hybrid flow shop problem using energetic reasoning and global operations

Omega ◽  
2001 ◽  
Vol 29 (6) ◽  
pp. 501-511 ◽  
Author(s):  
Emmanuel Néron ◽  
Philippe Baptiste ◽  
Jatinder N.D Gupta
Keyword(s):  
Flow Shop ◽  
Hybrid Flow Shop ◽  
Flow Shop Problem ◽  
Energetic Reasoning ◽  
Global Operations
Sign in / Sign up

Export Citation Format

Share Document