The Complexity of Single Machine Scheduling with Two Distinct Deadlines and Identical Decreasing Rates of Processing Times
The makespan problem on a single machine for a set of tasks with two distinct deadlines and identical decreasing rates of processing times is considered in this paper. Ho et al. [1] have proposed a model of a task system in which the processing time of a task decreases with its starting time. When t...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
1998
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/876 https://doi.org/10.1016/s0898-1221(98)00099-6 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |