Scheduling with step-improving processing times

被引:9
|
作者
Cheng, TCE
He, Y
Hoogeveen, H
Ji, M
Woeginger, GJ
机构
[1] Univ Utrecht, Dept Comp Sci, NL-3508 TB Utrecht, Netherlands
[2] Hong Kong Polytech Univ, Dept Logist, Kowloon, Hong Kong, Peoples R China
[3] Zhejiang Univ, Dept Math, State Key Lab CAD&CG, Hangzhou 310027, Peoples R China
[4] Tech Univ Eindhoven, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
基金
中国国家自然科学基金;
关键词
scheduling; knapsack problem; approximation scheme; competitive analysis;
D O I
10.1016/j.orl.2005.03.002
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider the scheduling problem of minimizing the makespan on a single machine with step-improving job processing times around a common critical date. For this problem we give an NP-hardness proof, a fast pseudo-polynomial time algorithm, an FPTAS, and an on-line algorithm with best possible competitive ratio. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:37 / 40
页数:4
相关论文
共 50 条
  • [1] A simple linear time algorithm for scheduling with step-improving processing times
    Ji, Min
    He, Yong
    Cheng, T. C. E.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (08) : 2396 - 2402
  • [2] A bicriterion single-machine scheduling problem with step-improving processing times
    Wu, Chin-Chia
    Lin, Win-Chin
    Azzouz, Ameni
    Xu, Jianyou
    Chiu, Yen-Lin
    Tsai, Yung-Wei
    Shen, Pengyi
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 171
  • [3] A bicriterion single-machine scheduling problem with step-improving processing times
    Wu, Chin -Chia
    Lin, Win -Chin
    Azzouz, Ameni
    Xu, Jianyou
    Chiu, Yen -Lin
    Tsai, Yung -Wei
    Shen, Pengyi
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 171
  • [4] Scheduling of step-improving jobs with an identical improving rate
    Kim, Hyun-Jung
    Kim, Eun-Seok
    Lee, Jun-Ho
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2022, 73 (05) : 1127 - 1136
  • [5] On scheduling of step-improving jobs to minimize the total weighted completion time
    Cheng, T. C. E.
    Kravchenko, Svetlana A.
    Lin, Bertrand M. T.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2024, 75 (04) : 720 - 730
  • [6] Single machine scheduling with step-deteriorating processing times
    Cheng, TCE
    Ding, Q
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 134 (03) : 623 - 630
  • [7] Batch scheduling with step-deteriorating processing times to minimize flowtime
    Mor, Baruch
    Mosheiov, Gur
    [J]. NAVAL RESEARCH LOGISTICS, 2012, 59 (08) : 587 - 600
  • [8] Makespan minimization in single-machine scheduling with step-deterioration of processing times
    Jeng, AAK
    Lin, BMT
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2004, 55 (03) : 247 - 256
  • [9] A survey of scheduling with controllable processing times
    Shabtay, Dvir
    Steiner, George
    [J]. DISCRETE APPLIED MATHEMATICS, 2007, 155 (13) : 1643 - 1666
  • [10] SCHEDULING JOBS WITH VARYING PROCESSING TIMES
    GAWIEJNOWICZ, S
    PANKOWSKA, L
    [J]. INFORMATION PROCESSING LETTERS, 1995, 54 (03) : 175 - 178