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.

An Efficient Hybrid Based on HS and GA Solving Blocking Flow Shop Scheduling Problems

2012 ◽  
Vol 479-481 ◽  
pp. 1893-1896
Author(s):  
Yun Bao ◽  
Liping Zheng ◽  
Hua Jiang
Keyword(s):  
Genetic Algorithm ◽  
Computational Result ◽  
Flow Shop ◽  
Harmony Search ◽  
Hybrid Algorithms ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Better Than

This paper presents an efficient hybrid algorithms (EHA) based on harmony search (HS) algorithms and genetic algorithm (GA) for solving blocking flow shop scheduling problem. An improved GA is used to get better results. The computational result shows that EHA is not only better than GA , but also better than HS algorithm.

The Research of Heuristic Algorithm for Flow Shop Scheduling Problem

2012 ◽  
Vol 605-607 ◽  
pp. 528-531
Author(s):  
Dan Tang ◽  
Hong Ping Shu
Keyword(s):  
Heuristic Algorithm ◽  
Processing Time ◽  
Flow Shop ◽  
Heuristic Method ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Average Quality ◽  
Simulation Experiments ◽  
Shop Scheduling ◽  
Better Than

For the flow shop scheduling problem which aims to minimize makespan, this paper gives a new derivation about its mathematical definition, and mining characteristics of the problem itself further. By which analysis, the new heuristic method proposed in the paper shorten the waiting time of each job as much as possible on the basis of reduce the processing time of the first machine and last job. The result of simulation experiments shows that, our new heuristic algorithm has good performance, and the average quality and stability of scheduling sequences generated by new method is significantly better than other heuristic algorithm which has the same complexity.

Sign in / Sign up

Export Citation Format

Share Document