Single Machine Scheduling with Step-Deteriorating Processing Times
We study in this paper a scheduling model in which each task has a normal processing time which deteriorates as a step function if its starting time is beyond a given deteriorating date. We focus on problems with identical task deteriorating dates. We show that the flow time problem is NP-complete a...
Saved in:
Main Authors: | Cheng, T. C. E., DING, Qing |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2001
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/872 https://doi.org/10.1016/s0377-2217(00)00284-8 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
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) -
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) -
Single Machine Scheduling with Deadlines and Increasing Rates of Processing Times
by: Cheng, T. C. E., et al.
Published: (2000) -
Scheduling Jobs with Piecewise Linear Decreasing Processing Times
by: Cheng, T. C. E., et al.
Published: (2003) -
The Complexity of Scheduling Starting Time Dependent Tasks with Release Times
by: Cheng, T. C. E., et al.
Published: (1998)