The Complexity of Scheduling Starting Time Dependent Tasks with Release Times
Saved in:
Main Authors: | Cheng, T. C. E., DING, Qing |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
1998
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/875 https://doi.org/10.1016/s0020-0190(97)00195-6 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Scheduling Start Time Dependent Tasks with Deadlines and Identical Initial Processing Times on a Single Machine
by: Cheng, T. C. E., et al.
Published: (2003) -
A Concise Survey of Scheduling with Time-Dependent Processing Times
by: Cheng, T. C. E., et al.
Published: (2004) -
The Complexity of Single Machine Scheduling with Two Distinct Deadlines and Identical Decreasing Rates of Processing Times
by: Cheng, T. C. E., et al.
Published: (1998) -
Single Machine Scheduling with Step-Deteriorating Processing Times
by: Cheng, T. C. E., et al.
Published: (2001) -
The Time Dependent Machine Makespan Problem Is Strongly Np-Complete
by: Cheng, T. C. E., et al.
Published: (1999)