scholarly journals The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem

2001 ◽  
Vol 49 (2) ◽  
pp. 293-304 ◽  
Author(s):  
Philip Kaminsky ◽  
David Simchi-Levi
Keyword(s):  
Completion Time ◽  
Flow Shop ◽  
Asymptotic Optimality ◽  
Time Problem ◽  
Spt Rule

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.

scholarly journals Optimal Research and Numerical Simulation for Scheduling No-Wait Flow Shop in Steel Production

2013 ◽  
Vol 2013 ◽  
pp. 1-5 ◽  
Author(s):  
Huawei Yuan ◽  
Yuanwei Jing ◽  
Jinping Huang ◽  
Tao Ren
Keyword(s):  
Lower Bound ◽  
Completion Time ◽  
Flow Shop ◽  
Asymptotic Optimality ◽  
Steel Production ◽  
Flow Shop Scheduling ◽  
Performance Guarantee ◽  
Shop Scheduling ◽  
No Wait ◽  
Typical Model

This paper considers them-machine flow shop scheduling problem with the no-wait constraint to minimize total completion time which is the typical model in steel production. First, the asymptotic optimality of the Shortest Processing Time (SPT) first rule is proven for this problem. To further evaluate the performance of the algorithm, a new lower bound with performance guarantee is designed. At the end of the paper, numerical simulations show the effectiveness of the proposed algorithm and lower bound.

Sign in / Sign up

Export Citation Format

Share Document