A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems

2011 ◽  
Vol 49 (17) ◽  
pp. 5207-5230 ◽  
Author(s):  
Pei-Chann Chang ◽  
Wei-Hsiu Huang ◽  
Ching-Jung Ting
Keyword(s):  
Flow Shop ◽  
Immune Algorithm ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling

An Effective Immune Based Approach for the No-Wait Flow Shop Scheduling Problems with Multiple Machines

2010 ◽  
Vol 97-101 ◽  
pp. 2432-2435 ◽  
Author(s):  
Yi Chih Hsieh ◽  
Y.C. Lee ◽  
Peng Sheng You ◽  
Ta Cheng Chen
Keyword(s):  
Flow Shop ◽  
Immune Algorithm ◽  
Flow Shop Scheduling ◽  
Benchmark Problems ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Practical Applications ◽  
Shop Scheduling ◽  
No Wait ◽  
Better Than

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.

Two-machine flow shop scheduling problems with minimal and maximal delays

4OR ◽  
2006 ◽  
Vol 4 (1) ◽  
pp. 15-28 ◽  
Author(s):  
Jean-Louis Bouquard ◽  
Christophe Lenté
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling
Sign in / Sign up

Export Citation Format

Share Document