Advertisement

Journal of Scheduling

, Volume 13, Issue 2, pp 123–129 | Cite as

Minimizing the total weighted completion time in the relocation problem

  • Alexander V. Kononov
  • Bertrand M. T. LinEmail author
Article

Abstract

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.

Relocation problem Resource-constrained scheduling NP-hardness Approximation algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Amir, A., & Kaplan, E. H. (1988). Relocation problems are hard. International Journal of Computer Mathematics, 25, 101–110. CrossRefGoogle Scholar
  2. Blazewicz, J., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1983). Scheduling subject to resource constraints: classification and complexity. Discrete Applied Mathematics, 5, 11–24. CrossRefGoogle Scholar
  3. Brucker, P., Drexl, A., Möhring, R., Neumann, K., & Pesch, E. (1999). Resource-constrained project scheduling: notation, classification, models and methods. European Journal of Operational Research, 112(1), 3–41. CrossRefGoogle Scholar
  4. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. Freedman: San Francisco. Google Scholar
  5. Hammer, P. L. (1986). Scheduling under resource constraints—deterministic models. Annals of operations research : Vol. 7. Basel: Baltzer. Google Scholar
  6. Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1, 61–67. CrossRefGoogle Scholar
  7. Kaplan, E. H. (1986). Relocation models for public housing redevelopment programs. Planning and Design, 13(1), 5–19. CrossRefGoogle Scholar
  8. Kaplan, E. H., & Amir, A. (1988). A fast feasibility test for relocation problems. European Journal of Operational Research, 35, 201–205. CrossRefGoogle Scholar
  9. Kaplan, E. H., & Berman, O. (1988). Orient Heights housing projects. Interfaces, 18(6), 14–22. CrossRefGoogle Scholar
  10. Kononov, A. V., & Lin, B. M. T. (2006). On the relocation problems with multiple identical working crews. Discrete Optimization, 3(4), 368–381. CrossRefGoogle Scholar
  11. Korte, B., & Vygen, J. (2006). Combinatorial Optimization: Theory and Algorithms : Vol. 21. Berlin: Springer. Google Scholar
  12. 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
  13. Smith, W. E. (1956). Various optimizers for single stage production. Naval Research Logistics Quarterly, 3, 59–66. CrossRefGoogle Scholar
  14. Xie, J.-X. (1997). Polynomial algorithms for single machine scheduling problems with financial constraints. Operations Research Letters, 21(1), 39–42. CrossRefGoogle Scholar
  15. 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

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Sobolev Institute of MathematicsNovosibirskRussia
  2. 2.Novosibirsk State UniversityNovosibirskRussia
  3. 3.Institute of Information Management, Department of Information and Finance ManagementNational Chiao Tung UniversityHsinchuTaiwan

Personalised recommendations