Optimal Results and Numerical Simulations for Flow Shop Scheduling Problems
Keyword(s):
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.
2010 ◽
Vol 1
(1)
◽
pp. 1-10
◽
2009 ◽
Vol 17
(04)
◽
pp. 559-584
◽
2015 ◽
Vol 2015
◽
pp. 1-8
◽
Keyword(s):
2015 ◽
Vol 83
(5-8)
◽
pp. 1135-1151
◽
2016 ◽
Vol 232
(3)
◽
pp. 534-545
◽
2014 ◽
Vol 643
◽
pp. 374-379