Relocation scheduling in a two-machine flow shop with resource recycling operations

Bertrand M.T. Lin*, Ting-Chung Lo

*此作品的通信作者

研究成果: Article同行評審

2 引文 斯高帕斯(Scopus)

摘要

This paper considers a variant of the relocation problem, which is formulated from an urban renewal project. There is a set of jobs to be processed in a two-machine flow shop subject to a given initial resource level. Each job consumes some units of the resource to start its processing on machine 1 and will return some amount of the resource when it is completed on machine 2. The amount of resource released by a job is not necessarily equal to the amount of resource acquired by the job for starting the process. Subject to the resource constraint, the problem is to find a feasible schedule whose makespan is minimum. In this paper, we first prove the NP-hardness of two special cases. Two heuristic algorithms with different processing characteristics, permutation and non-permutation, are designed to construct feasible schedules. Ant colony optimization (ACO) algorithms are also proposed to produce approximate solutions. We design and conduct computational experiments to appraise the performances of the proposed algorithms.
原文American English
文章編號1527
期刊Mathematics
9
發行號13
DOIs
出版狀態Published - 29 6月 2021

指紋

深入研究「Relocation scheduling in a two-machine flow shop with resource recycling operations」主題。共同形成了獨特的指紋。

引用此