scholarly journals An ant colony system for solving fuzzy flow shop scheduling problem

2012 ◽  
Vol 1 (2) ◽  
pp. 44 ◽  
Author(s):  
Nasser Shahsavari Pour ◽  
Mohammad hossein Abolhasani Ashkezari ◽  
Hamed Mohammadi Andargoli
Keyword(s):  
Fuzzy Numbers ◽  
Flow Shop ◽  
Ant Colony ◽  
Flow Shop Scheduling ◽  
Process Time ◽  
Ant Colony System ◽  
Scheduling Problem ◽  
Computational Results ◽  
Shop Scheduling ◽  
The Past

During the past years, the flow shop has been regarded by many researchers and some extensive investigations have been done on this respect. Flow Shop includes n works performed on m machines in a same sequence. It is very difficult in the real world to determine the exact process time of an operation on a machine. Therefore, we consider in this article the process time as trapezoidal fuzzy numbers. Our purpose is that we obtain a sequence of works using such fuzzy numbers in order to minimize maximum fuzzy time of completion entire jobs or fuzzy makespan. We offered an optimization algorithm of Ant Colony System (ACS) to solve this problem. Finally, we present computational results for explanation and comparison with other articles in future.

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.

scholarly journals The Moth-Flame Optimization Algorithm for Flow Shop Scheduling Problem with Travel Time

2021 ◽  
Vol 22 (2) ◽  
pp. 224-235
Author(s):  
Ikhlasul Amallynda ◽  
Bhisma Hutama
Keyword(s):  
Travel Time ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Computational Results ◽  
Shop Scheduling ◽  
Flow Shop Problem ◽  
Scheduling Method ◽  
Moth Flame Optimization Algorithm ◽  
Iteration Parameters

This article examined the flow shop scheduling problem by considering the travel time between machines. The objective function of this problem was to provide a makespan. The Moth Flame Optimization (MFO) algorithm was proposed to solve the flow shop problem. The MFO experiment was carried out with a combination of iteration parameters and the population of the MFO algorithm to solve the flow shop scheduling problem. The computational results showed that MFO could produce a better solution than the actual scheduling method. Furthermore, the MFO Proposal Algorithm was able to reduce the makespan by up to 3%.

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