Resource-constrained flowshop scheduling with separate resource recycling operations

Authors:
T. C. E. Cheng;B. M. T. Lin;H. L. Huang
Affiliations:
Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong;Institute of Information Management, Department of Information and Finance Management, National Chiao Tung University, Hsinchu 300, Taiwan;Institute of Information Management, Department of Information and Finance Management, National Chiao Tung University, Hsinchu 300, Taiwan
Venue:
Computers and Operations Research
Year:
2012

Citing 4
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On the relocation problem with a second working crew for resource recycling

International Journal of Systems Science
On relocation problems with multiple identical working crews

Discrete Optimization
Polynomial algorithms for single machine scheduling problems with financial constraints

Operations Research Letters

Quantified Score

Hi-index	0.02

Visualization

Abstract

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.