Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems

This paper considers the m-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 strate...

Full description

Bibliographic Details
Main Authors: Tao Ren, Yuandong Diao, Xiaochuan Luo
Format: Article
Language:English
Published: Hindawi Limited 2012-01-01
Series:Journal of Applied Mathematics
Online Access:http://dx.doi.org/10.1155/2012/395947