Skip to main content
SpringerLink
Log in

Minimizing the total weighted completion time in the relocation problem

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Amir, A., & Kaplan, E. H. (1988). Relocation problems are hard. International Journal of Computer Mathematics, 25, 101–110.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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 

  • Johnson, S. M. (1954). Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1, 61–67.

    Article  Google Scholar 

  • Kaplan, E. H. (1986). Relocation models for public housing redevelopment programs. Planning and Design, 13(1), 5–19.

    Article  Google Scholar 

  • Kaplan, E. H., & Amir, A. (1988). A fast feasibility test for relocation problems. European Journal of Operational Research, 35, 201–205.

    Article  Google Scholar 

  • Kaplan, E. H., & Berman, O. (1988). Orient Heights housing projects. Interfaces, 18(6), 14–22.

    Article  Google Scholar 

  • Kononov, A. V., & Lin, B. M. T. (2006). On the relocation problems with multiple identical working crews. Discrete Optimization, 3(4), 368–381.

    Article  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.

  • Smith, W. E. (1956). Various optimizers for single stage production. Naval Research Logistics Quarterly, 3, 59–66.

    Article  Google Scholar 

  • Xie, J.-X. (1997). Polynomial algorithms for single machine scheduling problems with financial constraints. Operations Research Letters, 21(1), 39–42.

    Article  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

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Novosibirsk, Russia

    Alexander V. Kononov

  2. Novosibirsk State University, Novosibirsk, Russia

    Alexander V. Kononov

  3. Institute of Information Management, Department of Information and Finance Management, National Chiao Tung University, Hsinchu, 300, Taiwan

    Bertrand M. T. Lin

Authors
  1. Alexander V. Kononov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bertrand M. T. Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bertrand M. T. Lin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kononov, A.V., Lin, B.M.T. Minimizing the total weighted completion time in the relocation problem. J Sched 13, 123–129 (2010). https://doi.org/10.1007/s10951-009-0151-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-009-0151-7

Search

Navigation