Hybrid Genetic Simulated Annealing Algorithm for Improved Flow Shop Scheduling with 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...
Main Authors: | Hongjing Wei, Shaobo Li, Houmin Jiang, Jie Hu, Jianjun Hu |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-12-01
|
Series: | Applied Sciences |
Subjects: | |
Online Access: | https://www.mdpi.com/2076-3417/8/12/2621 |
Similar Items
-
Job shop scheduling with makespan objective: A heuristic approach
by: Mohsen Ziaee
Published: (2014-04-01) -
Revisiting the NEH algorithm- the power of job insertion technique for optimizing the makespan in permutation flow shop scheduling
by: A. Baskar
Published: (2016-04-01) -
PENDEKATAN ALGORITMA CROSS ENTROPY-GENETIC ALGORITHM UNTUK MENURUNKAN MAKESPAN PADA PENJADWALAN FLOW SHOP
by: Dian Setiya Widodo, et al.
Published: (2014-02-01) -
Improved Scheduling for the Three-Machine Proportionate Open Shop and Mixed Shop Minimum Makespan Problems
by: Guanqun Ni, et al.
Published: (2020-01-01) -
Hybrid Flow Shop Scheduling Problems Using Improved Fireworks Algorithm for Permutation
by: Xuelian Pang, et al.
Published: (2020-02-01)