COMPLEXITY OF SCHEDULING TASKS WITH TIME-DEPENDENT EXECUTION TIMES

被引：92
|
作者：
HO, KIJ [1 ]
LEUNG, JYT [1 ]
WEI, WD [1 ]
机构：
[1] UNIV NEBRASKA LINCOLN,DEPT COMP SCI & ENGN,LINCOLN,NE 68588
来源：
INFORMATION PROCESSING LETTERS | 1993年 / 48卷 / 06期
关键词：
NP-COMPLETE; ALGORITHMS; POLYNOMIAL-TIME ALGORITHM; NONPREEMPTIVE SCHEDULE; RELEASE TIME; DEADLINE; FEASIBLE SCHEDULE; SINGLE PROCESSOR;
D O I：
10.1016/0020-0190(93)90175-9
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A new model of task system in which the execution time of a task depends on its starting time is considered. It is shown that the feasibility problem on a single processor is NP-complete for a set of tasks with identical release times and two distinct deadlines. An O(n log n)-time algorithm is given for a set of tasks with identical release times and deadlines. These two results give a sharp boundary delineating the complexity of the problem.
引用
收藏
页码：315 / 320
页数：6
相关论文
共 50 条
  • [41] Orbital complexity in a time-dependent potential
    Boily, C. M.
    Detemple, L.
    Faber, N. T.
    ASTRONOMISCHE NACHRICHTEN, 2008, 329 (9-10) : 998 - 1003
  • [42] On the Complexity of Time-Dependent Shortest Paths
    Foschini, Luca
    Hershberger, John
    Suri, Subhash
    PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 327 - 341
  • [43] Holographic complexity for time-dependent backgrounds
    Momeni, Davood
    Faizal, Mir
    Bahamonde, Sebastian
    Myrzakulov, Ratbay
    PHYSICS LETTERS B, 2016, 762 : 276 - 282
  • [44] On the Complexity of Time-Dependent Shortest Paths
    Luca Foschini
    John Hershberger
    Subhash Suri
    Algorithmica, 2014, 68 : 1075 - 1097
  • [45] Solving the Agile Earth Observation Satellite Scheduling Problem With Time-Dependent Transition Times
    Peng, Guansheng
    Song, Guopeng
    He, Yongming
    Yu, Jing
    Xiang, Shang
    Xing, Lining
    Vansteenwegen, Pieter
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2022, 52 (03): : 1614 - 1625
  • [46] Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine
    Qian, Jianbo
    Steiner, George
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 225 (03) : 547 - 551
  • [47] Flow shop scheduling to minimize makespan with decreasing time-dependent job processing times
    Wang, Xiao-Yuan
    Wang, Ming-Zheng
    Wang, Ji-Bo
    COMPUTERS & INDUSTRIAL ENGINEERING, 2011, 60 (04) : 840 - 844
  • [48] The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
    Bigras, Louis-Philippe
    Gamache, Michel
    Savard, Gilles
    DISCRETE OPTIMIZATION, 2008, 5 (04) : 685 - 699
  • [49] A note on single-machine scheduling with decreasing time-dependent job processing times
    Wang, Ji-Bo
    APPLIED MATHEMATICAL MODELLING, 2010, 34 (02) : 294 - 300
  • [50] Learning to Construct a Solution for the Agile Satellite Scheduling Problem With Time-Dependent Transition Times
    Chen, Ming
    Du, Yonghao
    Tang, Ke
    Xing, Lining
    Chen, Yuning
    Chen, Yingwu
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2024, 54 (10): : 5949 - 5963
12345