期刊
INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING
卷 23, 期 2, 页码 146-154出版社
TAYLOR & FRANCIS LTD
DOI: 10.1080/09511920903440339
关键词
branch-and-bound; hybrid flow shop; one-of-a-kind production (OKP); resource allocation
In one-of-a-kind production (OKP) companies, the number of production resources in each work centre of a production line is flexible in shifts because the resource demands of customer orders are always different from shift to shift. In this paper an optimisation model is established to achieve an optimal resource allocation plan ensuring that all jobs are finished in a given time interval with a minimum number of resources and without any buffer overflow. A branch-and-bound algorithm is developed to solve the problem. Two theorems are proved and applied in the algorithm to improve its pruning efficiency. A real industrial application is implemented for Gienow Windows and Doors Ltd. based on this model and algorithm. Experimental results show that this method is effective.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据