Single Machine Scheduling with Deadlines and Increasing Rates of Processing Times
The makespan, flow time and maximum lateness problems of scheduling a set of tasks with deadlines and increasing rates of processing times on a single machine are considered in this paper. We first show that, when the increasing rates of processing time are identical, the makespan problem is equival...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
2000
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/873 https://doi.org/10.1007/s002360050170 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |