Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic

2011 ◽  
Vol 38 (1) ◽  
pp. 152-164 ◽  
Author(s):  
Xiangyong Li ◽  
M.F. Baki ◽  
Y.P. Aneja
Keyword(s):  
Ant Colony Optimization ◽  
Completion Time ◽  
Flow Shop ◽  
Ant Colony ◽  
Flow Shop Scheduling ◽  
Total Completion Time ◽  
Shop Scheduling

USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS

2009 ◽  
Vol 17 (04) ◽  
pp. 559-584 ◽  
Author(s):  
PENG-JEN LAI ◽  
HSIEN-CHUNG WU
Keyword(s):  
Completion Time ◽  
Ant Colony Algorithm ◽  
Fuzzy Numbers ◽  
Flow Shop ◽  
Computational Procedure ◽  
Ant Colony ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Processing Times

The flow shop scheduling problems with fuzzy processing times are investigated in this paper. For some special kinds of fuzzy numbers, the analytic formulas of the fuzzy compltion time can be obtained. For the general bell-shaped fuzzy numbers, we present a computational procedure to obtain the approximated membership function of the fuzzy completion time. We define a defuzzification function to rank the fuzzy numbers. Under this ranking concept among fuzzy numbers, we plan to minimize the fuzzy makespan and total weighted fuzzy completion time. Because the ant colony algorithm has been successfully used to solve the scheduling problems with real-valued processing times, we shall also apply the ant colony algorithm to search for the best schedules when the processing times are assumed as fuzzy numbers. Numerical examples are also provided and solved by using the commercial software MATLAB.

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.

Sign in / Sign up

Export Citation Format

Share Document