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
关键词
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 条
  • [21] A note on unrelated parallel machine scheduling with time-dependent processing times
    Kuo, W-H
    Hsu, C-J
    Yang, D-L
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2009, 60 (03) : 431 - 434
  • [22] Single-Machine Time-Dependent Scheduling with Proportional and Delivery Times
    Miao, Cuixia
    Song, Jiaxin
    Zhang, Yuzhong
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2023, 40 (04)
  • [23] A note on unrelated parallel machine scheduling with time-dependent processing times
    Li, Chung-Lun
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2008, 59 (12) : 1696 - 1697
  • [24] Algorithms for dynamic scheduling of unit execution time tasks
    Díaz, AR
    Tchernykh, A
    Ecker, KH
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2003, 146 (02) : 403 - 416
  • [25] SCHEDULING MAINTENANCE TASKS WITH TIME-DEPENDENT SYNCHRONIZATION CONSTRAINTS BY A CP MODELING APPROACH
    Lange, Jan
    Weigert, Gerald
    Klemmt, Andreas
    Doherr, Peter
    2013 WINTER SIMULATION CONFERENCE (WSC), 2013, : 3642 - +
  • [26] EDF Scheduling for Tasks with Uncertain Execution Times in Networked Control System
    Shi, Tingna
    Chen, Zhengwei
    Xia, Changliang
    Fang, Hongwei
    Wang, Sujuan
    ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 5, PROCEEDINGS, 2008, : 207 - 211
  • [27] Minimizing cycle time in single machine scheduling with start time-dependent processing times
    Farahani, Mehdi Hosseinabadi
    Hosseini, Leila
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 64 (9-12): : 1479 - 1486
  • [28] Minimizing cycle time in single machine scheduling with start time-dependent processing times
    Mehdi Hosseinabadi Farahani
    Leila Hosseini
    The International Journal of Advanced Manufacturing Technology, 2013, 64 : 1479 - 1486
  • [29] Schedulability Analysis of Tasks with Corunner-Dependent Execution Times
    Andersson, Bjorn
    Kim, Hyoseung
    De Niz, Dionisio
    Klein, Mark
    Rajkumar, Ragunathan Raj
    Lehoczky, John
    ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2018, 17 (03)
  • [30] Project-Scheduling Problem With Random Time-Dependent Activity Duration Times
    Huang, Wei
    Ding, Lixin
    IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT, 2011, 58 (02) : 377 - 387