scholarly journals On the n-job, m-machine permutation flow shop scheduling problems with makespan criterion and rework

2017 ◽  
Vol 0 (0) ◽  
pp. 0-0
Author(s):  
Behrang Bootaki ◽  
Mohammad Mahdi Paydar
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Permutation Flow Shop Scheduling ◽  
Permutation Flow Shop ◽  
Makespan Criterion

scholarly journals Hybrid Flow Shop Scheduling Problems Using Improved Fireworks Algorithm for Permutation

2020 ◽  
Vol 10 (3) ◽  
pp. 1174 ◽  
Author(s):  
Xuelian Pang ◽  
Haoran Xue ◽  
Ming-Lang Tseng ◽  
Ming K. Lim ◽  
Kaihua Liu
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Scheduling Problems ◽  
Gaussian Mutation ◽  
Fireworks Algorithm ◽  
Shop Scheduling ◽  
Permutation Flow Shop Scheduling ◽  
Hybrid Flow Shop Scheduling ◽  
Permutation Flow Shop

Prior studies are lacking which address permutation flow shop scheduling problems and hybrid flow shop scheduling problems together to help firms find the optimized scheduling strategy. The permutation flow shop scheduling problem and hybrid flow shop scheduling problems are important production scheduling types, which widely exist in industrial production fields. This study aimed to acquire the best scheduling strategy for making production plans. An improved fireworks algorithm is proposed to minimize the makespan in the proposed strategies. The proposed improved fireworks algorithm is compared with the fireworks algorithm, and the improvement strategies include the following: (1) A nonlinear radius is introduced and the minimum explosion amplitude is checked to avoid the waste of optimal fireworks; (2) The original Gaussian mutation operator is replaced by a hybrid operator that combines Cauchy and Gaussian mutation to improve the search ability; and (3) An elite group selection strategy is adopted to reduce the computing costs. Two instances from the permutation flow shop scheduling problem and hybrid flow shop scheduling problems were used to evaluate the improved fireworks algorithm’s performance, and the computational results demonstrate the improved fireworks algorithm’s superiority.

scholarly journals Critical paths of non-permutation and permutation flow shop scheduling problems

2020 ◽  
pp. 281-298 ◽  
Author(s):  
Daniel Alejandro Rossit ◽  
Fernando Tohmé ◽  
Mariano Frutos ◽  
Martín Safe ◽  
Óscar C. Vásquez
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Permutation Flow Shop Scheduling ◽  
Permutation Flow Shop ◽  
Critical Paths
Sign in / Sign up

Export Citation Format

Share Document