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
来源：
OPERATIONS RESEARCH LETTERS | 2006年 / 34卷 / 01期
基金：
中国国家自然科学基金;
关键词：
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 条
  • [41] SINGLE FACILITY SCHEDULING WITH NONLINEAR PROCESSING TIMES
    GUPTA, JND
    GUPTA, SK
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 1988, 14 (04) : 387 - 393
  • [42] Single machine scheduling with resource dependent release times and processing times
    Wang, XL
    Cheng, TCE
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 162 (03) : 727 - 739
  • [43] Group scheduling with independent setup times, ready times, and deteriorating job processing times
    Wang, Ji-Bo
    Huang, Xue
    Wu, Yu-Bin
    Ji, Ping
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 60 (5-8): : 643 - 649
  • [44] Group scheduling with independent setup times, ready times, and deteriorating job processing times
    Ji-Bo Wang
    Xue Huang
    Yu-Bin Wu
    Ping Ji
    [J]. The International Journal of Advanced Manufacturing Technology, 2012, 60 : 643 - 649
  • [45] Improving Mobile Efficiencies While Improving Donor Processing Times
    Meyers, M.
    Baldwin, A.
    Hadley, R.
    Venable, G. A.
    Frame-Brown, T. A.
    [J]. TRANSFUSION, 2012, 52 : 240A - 240A
  • [46] Minimum Makespan Scheduling with Low Rank Processing Times
    Bhaskara, Aditya
    Krishnaswamy, Ravishankar
    Talwar, Kunal
    Wieder, Udi
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 937 - 947
  • [47] Parallel Hybrid Metaheuristics for the Scheduling with Fuzzy Processing Times
    Bozejko, Wojciech
    Czapinski, Michal
    Wodecki, Mieczyslaw
    [J]. ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, PT II, 2010, 6114 : 379 - +
  • [48] A UNIFIED ANALYSIS FOR SCHEDULING PROBLEMS WITH VARIABLE PROCESSING TIMES
    Wang, Ji-Bo
    Zhang, Bo
    He, Hongyu
    [J]. JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2022, 18 (02) : 1063 - 1077
  • [49] Measures of problem uncertainty for scheduling with interval processing times
    Yuri N. Sotskov
    Tsung-Chyan Lai
    Frank Werner
    [J]. OR Spectrum, 2013, 35 : 659 - 689
  • [50] Scheduling with time dependent processing times: Review and extensions
    Alidaee, B
    Womer, NK
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1999, 50 (07) : 711 - 720
12345