Resource-constrained flowshop scheduling with separate resource recycling operations

T. C.E. Cheng, Miao-Tsong Lin*, H. L. Huang

*此作品的通信作者

研究成果: Article同行評審

9 引文 斯高帕斯(Scopus)

摘要

This paper considers the relocation problem arising from public re-development projects cast as a two-machine flowshop scheduling problem. In such a project, some buildings need to be torn down and re-constructed. The two processes of tearing down and re-constructing each building are often viewed as a single operation. However, under certain circumstances, the re-construction process, i.e., the resource recycling process, can be viewed as a separate operation. In this paper we regard these two processes as separate on the assumption that they are handled by different working crews. We formulate the problem as a resource-constrained two-machine flowshop scheduling problem with the objective of finding a feasible re-development sequence that minimizes the makespan. We provide problem formulations, discuss the complexity results, and present polynomial algorithms for various special cases of the problem.

原文English
頁(從 - 到)1206-1212
頁數7
期刊Computers and Operations Research
39
發行號6
DOIs
出版狀態Published - 六月 2012

指紋

深入研究「Resource-constrained flowshop scheduling with separate resource recycling operations」主題。共同形成了獨特的指紋。

引用此