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: | Cheng, T. C. E., DING, Qing |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
2000
|
主題: | |
在線閱讀: | https://ink.library.smu.edu.sg/lkcsb_research/873 https://doi.org/10.1007/s002360050170 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
A Failure Prone System with Delivery Deadline and Outsourced Maintenance
由: MOOSA, Sharafali, et al.
出版: (2012) -
The Complexity of Single Machine Scheduling with Two Distinct Deadlines and Identical Decreasing Rates of Processing Times
由: Cheng, T. C. E., et al.
出版: (1998) -
Coordinated batch processing machine scheduling with job delivery in semiconductor manufacturing
由: Fu, Qing.
出版: (2013) -
Manpower Scheduling with Time Windows
由: LIM, Andrew, et al.
出版: (2003) -
Scheduling Start Time Dependent Tasks with Deadlines and Identical Initial Processing Times on a Single Machine
由: Cheng, T. C. E., et al.
出版: (2003)