Hybrid approach using ant colony optimization and fuzzy logic to solve multi-criteria hybrid flow shop scheduling problem

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

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.

Research on a Main-Branch Hybrid Flow Shop Scheduling Problem in Production Manufacturing System

2012 ◽  
Vol 252 ◽  
pp. 354-359
Author(s):  
Xin Min Zhang ◽  
Meng Yue Zhang
Keyword(s):  
Manufacturing System ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Scheduling Problem ◽  
Quantum Genetic Algorithm ◽  
Shop Scheduling ◽  
Scheduling Model ◽  
Hybrid Flow Shop Scheduling ◽  
Two Stages

A main-branch hybrid Flow shop scheduling problem in production manufacturing system is studied. Under the premise of JIT, targeting of smallest cost, a Flow-Shop production line scheduling model is built in cycle time of buffer. Two stages Quantum Genetic Algorithm (QGA) is proposed. By the results of numerical example, the effective and advantageous of QGA was shown.

Sign in / Sign up

Export Citation Format

Share Document