科研之友
微信
新浪微博
Facebook
分享链接
摘要
The m-machine open shop problem to minimize the sum of the completion times is investigated in our paper. First, a heuristic algorithm, Shortest Processing Time Block, is presented to deal with problem O(m)vertical bar n = km vertical bar Sigma C(j), where k is positive integer. And then, the heuristic is extended to solve the general problem O(m)parallel to Sigma C(j). It is proved that the heuristic is asymptotically optimal when the job number goes to infinity. At the end of this paper, numerical experimentation results show the effectiveness of the heuristic algorithm.
- 出版日期2010-3
- 单位东北大学
