|
|
|
|
Optimal results and numerical simulations for flow shop scheduling problems
|
|
|
|
|
|
|
|
نویسنده
|
ren t. ,diao y. ,luo x.
|
|
منبع
|
journal of applied mathematics - 2012 - دوره : 2012 - شماره : 0
|
|
چکیده
|
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. copyright © 2012 tao ren et al.
|
|
|
|
|
آدرس
|
software college,northeastern university, China, personnel department,shenyang university of chemical technology, China, state key laboratory of synthetical automation for process industries,northeastern university, China
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|