A novel water wave optimization based memetic algorithm for flow-shop scheduling

2016 ◽  
Author(s):  
Xin Yun ◽  
Xiaoyi Feng ◽  
Xin Lyu ◽  
Shouyang Wang ◽  
Bo Liu
Keyword(s):  
Water Wave ◽  
Flow Shop ◽  
Memetic Algorithm ◽  
Flow Shop Scheduling ◽  
Shop Scheduling

Water Wave Optimization for Flow-Shop Scheduling

2019 ◽  
pp. 771-783
Author(s):  
Jia-Yu Wu ◽  
Xue Wu ◽  
Xue-Qin Lu ◽  
Yi-Chen Du ◽  
Min-Xia Zhang
Keyword(s):  
Water Wave ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Shop Scheduling

Parallel Machine Shop Scheduling Using Memetic Algorithm

2014 ◽  
Vol 573 ◽  
pp. 362-367
Author(s):  
Senthil Vairam ◽  
V. Selladurai
Keyword(s):  
Flow Shop ◽  
Memetic Algorithm ◽  
Parallel Machine ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Task Graph ◽  
Machine Shop ◽  
Shop Scheduling ◽  
Hybrid Flow Shop Scheduling

Parallel machine shop scheduling problem can be stated as finding a schedule for a general task graph to execute on a customed flow so that the schedule length can be minimized. Parallel Flow Shop Scheduling with a case study has been . In this study we present an effective memetic algorithm to solve the problem. Also evaluating the performance of two algorithms (genetic algorithm and memetic algorithm) in terms of both the quality of the solutions produced and the efficiency. These results demonstrate that the memetic algorithm produces better and quality solutions and hence it is very efficient . KEY WORDS: Hybrid Flow Shop Scheduling, Multiprocessor, Memetic algorithm.

Comparison of Heuristic for Flow Shop Scheduling Problems with Sequence Dependent Setup Time

2011 ◽  
Vol 339 ◽  
pp. 332-335 ◽  
Author(s):  
Parinya Kaweegitbundit
Keyword(s):  
Flow Shop ◽  
Memetic Algorithm ◽  
Setup Time ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Sequence Dependent ◽  
Sequence Dependent Setup Time ◽  
Sequence Dependent Setup ◽  
Makespan Criterion

This paper considers flow shop scheduling problems with sequence dependent setup time. The makespan criterion has been considered. In this paper presented a comparison of three heuristics for solves this problem. The memetic algorithm, genetic algorithm and NEH heuristic have been compared. In the experimental, the result from memetic algorithm is maximum the best solution. Therefore, the MA heuristic outperforms other heuristic.

Sign in / Sign up

Export Citation Format

Share Document