Exact and metaheuristic algorithms for flow-shop scheduling problems with release dates

2021 ◽  
pp. 1-17
Author(s):  
Tao Ren ◽  
Xinyue Wang ◽  
Tianyi Liu ◽  
Chin-Chia Wu ◽  
Danyu Bai ◽  
...  
Keyword(s):  
Flow Shop ◽  
Metaheuristic Algorithms ◽  
Flow Shop Scheduling ◽  
Release Dates ◽  
Scheduling Problems ◽  
Shop Scheduling

scholarly journals Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems

2012 ◽  
Vol 2012 ◽  
pp. 1-9
Author(s):  
Tao Ren ◽  
Yuandong Diao ◽  
Xiaochuan Luo
Keyword(s):  
Local Search ◽  
Completion Time ◽  
Flow Shop ◽  
Asymptotic Optimality ◽  
Flow Shop Scheduling ◽  
Release Dates ◽  
Scheduling Problems ◽  
Improvement Strategy ◽  
Shop Scheduling ◽  
Flow Shop Problem

This paper considers them-machine flow shop problem with two objectives: makespan with release dates and total quadratic completion time, respectively. For Fm|rj|Cmax, we prove the asymptotic optimality for any dense scheduling when the problem scale is large enough. For Fm‖ΣCj2, improvement strategy with local search is presented to promote the performance of the classical SPT heuristic. At the end of the paper, simulations show the effectiveness of the improvement strategy.

Two-machine flow shop scheduling problems with minimal and maximal delays

4OR ◽  
2006 ◽  
Vol 4 (1) ◽  
pp. 15-28 ◽  
Author(s):  
Jean-Louis Bouquard ◽  
Christophe Lenté
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling
Sign in / Sign up

Export Citation Format

Share Document