An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion

2002 ◽  
Vol 23 (2) ◽  
pp. 323-344 ◽  
Author(s):  
Hui-Chin Tang
Keyword(s):  
Experimental Analysis ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Shop Scheduling ◽  
Minimum Makespan ◽  
Makespan Criterion

scholarly journals Hybrid Genetic Simulated Annealing Algorithm for Improved Flow Shop Scheduling with Makespan Criterion

2018 ◽  
Vol 8 (12) ◽  
pp. 2621 ◽  
Author(s):  
Hongjing Wei ◽  
Shaobo Li ◽  
Houmin Jiang ◽  
Jie Hu ◽  
Jianjun Hu
Keyword(s):  
Simulated Annealing ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Regulation Mechanism ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Wide Range ◽  
Random Crossover ◽  
Crossover And Mutation ◽  
Makespan Criterion

Flow shop scheduling problems have a wide range of real-world applications in intelligent manufacturing. Since they are known to be NP-hard for more than two machines, we propose a hybrid genetic simulated annealing (HGSA) algorithm for flow shop scheduling problems. In the HGSA algorithm, in order to obtain high-quality initial solutions, an MME algorithm, combined with the MinMax (MM) and Nawaz–Enscore–Ham (NEH) algorithms, was used to generate the initial population. Meanwhile, a hormone regulation mechanism for a simulated annealing (SA) schedule was introduced as a cooling scheme. Using MME initialization, random crossover and mutation, and the cooling scheme, we improved the algorithm’s quality and performance. Extensive experiments have been carried out to verify the effectiveness of the combination approach of MME initialization, random crossover and mutation, and the cooling scheme for SA. The result on the Taillard benchmark showed that our HGSA algorithm achieved better performance relative to the best-known upper bounds on the makespan compared with five state-of-the-art algorithms in the literature. Ultimately, 109 out of 120 problem instances were further improved on makespan criterion.

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