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 条
  • [31] On a generalized single machine scheduling problem with time-dependent processing times.
    Lazarev, Alexander A.
    Arkhipov, Dmitry I.
    Werner, Frank
    IFAC PAPERSONLINE, 2016, 49 (12): : 226 - 230
  • [32] A note on unrelated parallel machine scheduling with time-dependent processing times Reply
    Yang, D-L
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2008, 59 (12) : 1697 - 1697
  • [33] On index priority sequencing rules for scheduling with time-dependent job processing times
    Kyparisis, George J.
    Koulamas, Christos
    OPERATIONS RESEARCH LETTERS, 2013, 41 (05) : 445 - 448
  • [34] SCHEDULING TASKS WITH SEQUENCE-DEPENDENT PROCESSING TIMES
    BIANCO, L
    RICCIARDELLI, S
    RINALDI, G
    SASSANO, A
    NAVAL RESEARCH LOGISTICS, 1988, 35 (02) : 177 - 184
  • [35] The Times They Are A-Changin': Time-Dependent Exposures and Time-Dependent Confounders
    Frencken, Jos F.
    Postma, Douwe F.
    van Werkhoven, Cornelis H.
    Cremer, Olaf L.
    Bonten, Marc J. M.
    CLINICAL INFECTIOUS DISEASES, 2017, 65 (11) : 1959 - 1960
  • [36] Single-machine scheduling time-dependent jobs with resource-dependent ready times
    Zhu, Valerie C. Y.
    Sun, Linyan
    Sun, Linhui
    Li, Xiaohong
    COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 58 (01) : 84 - 87
  • [37] Time-dependent formulations for minimizing total completion time in a parallel machine scheduling problem with dependent setup times
    Baez, Sarahi
    Angel-Bello, Francisco
    Alvarez, Ada
    IFAC PAPERSONLINE, 2016, 49 (12): : 857 - 862
  • [38] Scheduling the Execution of Tasks at the Edge
    Kolomvatsos, Kostas
    Loukopoulos, Thanasis
    PROCEEDINGS OF THE 2018 IEEE INTERNATIONAL CONFERENCE ON EVOLVING AND ADAPTIVE INTELLIGENT SYSTEMS (EAIS), 2018,
  • [39] The Times They Are A-Changin': Time-Dependent Exposures and Time-Dependent Confounders Reply
    Violi, Francesco
    Cangemi, Roberto
    Farcomeni, Alessio
    Corrales-Medina, Vicente F.
    CLINICAL INFECTIOUS DISEASES, 2017, 65 (11) : 1960 - 1960
  • [40] On the Complexity of Time-Dependent Shortest Paths
    Foschini, Luca
    Hershberger, John
    Suri, Subhash
    ALGORITHMICA, 2014, 68 (04) : 1075 - 1097
12345