科研之友
微信
新浪微博
Facebook
分享链接
摘要
<jats:p>This paper considers the <jats:italic>m</jats:italic>-machine flow shop problem to minimize weighted completion time. A heuristic algorithm is presented to deal with the problem for large size problem. At the end of the paper, some numerical experiments show the effectiveness of the heuristic.</jats:p>
- 出版日期2014-9
- 单位Northeastern university; 东北大学
