Minimizing the total weighted completion time in the relocation problem

被引：11
|
作者：
Kononov, Alexander V. [2 ,3 ]
Lin, Bertrand M. T. [1 ]
机构：
[1] Natl Chiao Tung Univ, Inst Informat Management, Dept Informat & Finance Management, Hsinchu 300, Taiwan
[2] Sobolev Inst Math, Novosibirsk, Russia
[3] Novosibirsk State Univ, Novosibirsk 630090, Russia
来源：
JOURNAL OF SCHEDULING | 2010年 / 13卷 / 02期
关键词：
Relocation problem; Resource-constrained scheduling; NP-hardness; Approximation algorithm; CLASSIFICATION;
D O I：
10.1007/s10951-009-0151-7
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
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.
引用
收藏
页码：123 / 129
页数：7
相关论文
共 50 条
  • [1] Minimizing the total weighted completion time in the relocation problem
    Alexander V. Kononov
    Bertrand M. T. Lin
    [J]. Journal of Scheduling, 2010, 13 : 123 - 129
  • [2] Minimizing the total weighted completion time in relocation scheduling
    Su, Yi-Chen
    Lin, Bertrand M. T.
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 173
  • [3] Minimizing the total weighted completion time in relocation scheduling
    Su, Yi-Chen
    Lin, Bertrand M.T.
    [J]. Computers and Industrial Engineering, 2022, 173
  • [4] Flexible open-shop problem for minimizing weighted total completion time
    Mashizi, Iman Khosravi
    Kermani, Vahid Momenaei
    Shahsavari-Pour, Naser
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2022, 42 (03) : 1353 - 1366
  • [5] Minimizing the total weighted completion time of deteriorating jobs
    Bachman, A
    Janiak, A
    Kovalyov, MY
    [J]. INFORMATION PROCESSING LETTERS, 2002, 81 (02) : 81 - 84
  • [6] Minimizing total weighted completion time approximately for the parallel machine problem with a single server
    Hasani, Keramat
    Kravchenko, Svetlana A.
    Werner, Frank
    [J]. INFORMATION PROCESSING LETTERS, 2014, 114 (09) : 500 - 503
  • [7] Transportation and Batching Scheduling for Minimizing Total Weighted Completion Time
    Wei, Hongjun
    Yuan, Jinjiang
    Gao, Yuan
    [J]. MATHEMATICS, 2019, 7 (09)
  • [8] Parallel genetic algorithm for minimizing total weighted completion time
    Bozejko, W
    Wodecki, M
    [J]. ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING - ICAISC 2004, 2004, 3070 : 400 - 405
  • [9] Minimizing the Total Weighted Completion Time for Three Cooperating Agents
    Lee, Wen-Chiung
    Wang, Jen-Ya
    [J]. 2018 7TH INTERNATIONAL CONGRESS ON ADVANCED APPLIED INFORMATICS (IIAI-AAI 2018), 2018, : 618 - 621
  • [10] Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks
    Qiu, Zhen
    Stein, Cliff
    Zhong, Yuan
    [J]. SPAA'15: PROCEEDINGS OF THE 27TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2015, : 294 - 303
12345