Parallel Ant Colony Optimization for Flow Shop Scheduling Subject to Limited Machine Availability

2016 ◽  
Author(s):  
Yumei Huo ◽  
Jun Xiong Huang
Keyword(s):  
Ant Colony Optimization ◽  
Flow Shop ◽  
Ant Colony ◽  
Flow Shop Scheduling ◽  
Shop Scheduling ◽  
Machine Availability

A Hybrid Ant Colony Optimization Algorithm for Permutation Flow-Shop Scheduling in Manufacturing Systems and Industrial Process

2013 ◽  
Vol 345 ◽  
pp. 438-441
Author(s):  
Jing Chen ◽  
Xiao Xia Zhang ◽  
Yun Yong Ma
Keyword(s):  
Ant Colony Optimization ◽  
Hybrid Algorithm ◽  
Manufacturing Systems ◽  
Flow Shop ◽  
Ant Colony ◽  
Flow Shop Scheduling ◽  
Neighborhood Search ◽  
Shop Scheduling ◽  
Permutation Flow Shop Scheduling ◽  
Permutation Flow Shop

This paper presents a novel hybrid ant colony optimization approach (ACO&VNS) to solve the permutation flow-shop scheduling problem (PFS) in manufacturing systems and industrial process. The main feature of this hybrid algorithm is to hybridize the solution construction mechanism of the ant colony optimization (ACO) with variable neighborhood search (VNS) which can also be embedded into the ACO algorithm as neighborhood search to improve solutions. Moreover, the hybrid algorithm considers both solution diversification and solution quality. Finally, the experimental results for benchmark PFS instances have shown that the hybrid algorithm is very efficient to solve the permutation flow-shop scheduling in manufacturing engineering compared with the best existing methods in terms of solution quality.

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.

Sign in / Sign up

Export Citation Format

Share Document