Scheduling Start Time Dependent Tasks with Deadlines and Identical Initial Processing Times on a Single Machine

• المؤلفون الرئيسيون: Cheng, T. C. E., DING, Qing
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2003
• الموضوعات: Sequencing; Time dependence scheduling; Computational complexity; Business
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/lkcsb_research/871; https://doi.org/10.1016/s0305-0548(01)00077-6
• المؤسسة: Singapore Management University

In this paper, we study the feasibility problem of scheduling a set of start time dependent tasks on a single machine with deadlines, processing rates and identical initial processing times. First, we show that the cases with arbitrary deadlines are strongly NP-complete. Second, we show that the cas...