Three metaheuristics for solving the flow shop problem with permutation and sequence dependent setup time

2018 ◽  
Author(s):  
Said Aqil ◽  
Karam Allali
Keyword(s):  
Flow Shop ◽  
Setup Time ◽  
Sequence Dependent ◽  
Sequence Dependent Setup Time ◽  
Flow Shop Problem ◽  
Sequence Dependent Setup

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