On relocation problems with multiple identical working crews

Authors:
A. V. Kononov;B. M. T. Lin
Affiliations:
Sobolev Institute of Mathematics, Novosibirsk, Russia;Department of Information and Finance Management, Institute of Information Management, National Chiao Tung University, Hsinchu 300, Taiwan
Venue:
Discrete Optimization
Year:
2006

Citing 2
Cited 2

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

Computers and Intractability: A Guide to the Theory of NP-Completeness
Polynomial algorithms for single machine scheduling problems with financial constraints

Operations Research Letters

Tight complexity analysis of the relocation problem with arbitrary release dates

Theoretical Computer Science
Resource-constrained flowshop scheduling with separate resource recycling operations

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The relocation problem was formulated from a public housing project. In its basic form, a set of buildings needed to be torn down and erected by a single working crew. Given a fixed budget, the relocation problem seeks to determine a feasible reconstruction sequence of the old buildings. This problem has been shown to be mathematically equivalent to the classical two-machine flowshop of makespan minimization. In this paper, we consider a variant where multiple working crews are available for the redevelopment project. Most of our results center on the situations where all buildings require the same redevelopment time. We first present a strong NP-hardness proof for the case with two working crews. Then, we give a negative result about the approximability of the studied problem. Approximation algorithms and associated performance-ratio analysis are designed for the cases with unbounded as well as bounded numbers of machines.