Minimizing the total weighted completion time in the relocation problem
- 114 Downloads
This paper studies the minimization of total weighted completion time in the relocation problem on a single machine. The relocation problem, formulated from an area redevelopment project, can be treated as a resource-constrained scheduling problem. In this paper, we show four special cases to be NP-hard in the strong sense. Problem equivalence between the unit-weighted case and the UET (unit-execution-time) case is established. For two further restricted special cases, we present a polynomial time approximation algorithm and show its performance ratio to be 2.
Unable to display preview. Download preview PDF.
- Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. Freedman: San Francisco. Google Scholar
- Hammer, P. L. (1986). Scheduling under resource constraints—deterministic models. Annals of operations research : Vol. 7. Basel: Baltzer. Google Scholar
- Korte, B., & Vygen, J. (2006). Combinatorial Optimization: Theory and Algorithms : Vol. 21. Berlin: Springer. Google Scholar
- Sevastyanov, S. V., Lin, B. M. T., & Huang, H. L. (2009, in revision). Tight complexity analysis of the relocation problem with arbitrary release dates. Discrete Optimization. Google Scholar
- PHRG (1986). New lives for old buildings: revitalizing public housing project. Public Housing Group, Department of Urban Studies and Planning, MIT Press, Cambridge Google Scholar