Solving a multi-objective no-wait flow shop scheduling problem with an immune algorithm

2007 ◽  
Vol 36 (9-10) ◽  
pp. 969-981 ◽  
Author(s):  
R. Tavakkoli-Moghaddam ◽  
A. R. Rahimi-Vahed ◽  
A. H. Mirzaei
2010 ◽  
Vol 97-101 ◽  
pp. 2432-2435 ◽  
Author(s):  
Yi Chih Hsieh ◽  
Y.C. Lee ◽  
Peng Sheng You ◽  
Ta Cheng Chen

For scheduling problems, no-wait constraint is an important requirement for many industries. As known, the no-wait scheduling problem is NP-hard and has several practical applications. This paper applies an immune algorithm to solve the multiple-machine no-wait flow shop scheduling problem with minimizing the makespan. Twenty-three benchmark problems on the OR-Library are solved by the immune algorithm. Limited numerical results show that the immune algorithm performs better than the other typical approaches in the literature for most of instances.


2008 ◽  
Vol 40 (4) ◽  
pp. 331-346 ◽  
Author(s):  
A. R. Rahimi-Vahed ◽  
B. Javadi ◽  
M. Rabbani ◽  
R. Tavakkoli-Moghaddam

2017 ◽  
Vol 10 (5) ◽  
pp. 887 ◽  
Author(s):  
Hassan Jafarzadeh ◽  
Nazanin Moradinasab ◽  
Ali Gerami

Purpose: Adjusted discrete Multi-Objective Invasive Weed Optimization (DMOIWO) algorithm, which uses fuzzy dominant approach for ordering, has been proposed to solve No-wait two-stage flexible flow shop scheduling problem.Design/methodology/approach: No-wait two-stage flexible flow shop scheduling problem by considering sequence-dependent setup times and probable rework in both stations, different ready times for all jobs and rework times for both stations as well as unrelated parallel machines with regards to the simultaneous minimization of maximum job completion time and average latency functions have been investigated in a multi-objective manner. In this study, the parameter setting has been carried out using Taguchi Method based on the quality indicator for beater performance of the algorithm.Findings: The results of this algorithm have been compared with those of conventional, multi-objective algorithms to show the better performance of the proposed algorithm. The results clearly indicated the greater performance of the proposed algorithm.Originality/value: This study provides an efficient method for solving multi objective no-wait two-stage flexible flow shop scheduling problem by considering sequence-dependent setup times, probable rework in both stations, different ready times for all jobs, rework times for both stations and unrelated parallel machines which are the real constraints.


Sign in / Sign up

Export Citation Format

Share Document