Open Access
2012 Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems
Tao Ren, Yuandong Diao, Xiaochuan Luo
J. Appl. Math. 2012: 1-9 (2012). DOI: 10.1155/2012/395947


This paper considers the m-machine flow shop problem with two objectives: makespan with release dates and total quadratic completion time, respectively. For F m | r j | C max , we prove the asymptotic optimality for any dense scheduling when the problem scale is large enough. For F m Σ C j 2 , 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.


Download Citation

Tao Ren. Yuandong Diao. Xiaochuan Luo. "Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems." J. Appl. Math. 2012 1 - 9, 2012.


Published: 2012
First available in Project Euclid: 14 December 2012

zbMATH: 1235.90066
MathSciNet: MR2898071
Digital Object Identifier: 10.1155/2012/395947

Rights: Copyright © 2012 Hindawi

Vol.2012 • 2012
Back to Top