Single machine scheduling with step-deteriorating processing times
Authors:
- T.C.E. ChengTCT.C.E. Cheng
- Q. DingQDQ. Ding
- 1 November 2001
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 134 (3) , 623-630
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The time dependent machine makespan problem is strongly NP-completeComputers & Operations Research, 1999
- Scheduling deteriorating jobs to minimize makespanNaval Research Logistics (NRL), 1998
- The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing timesComputers & Mathematics with Applications, 1998
- The complexity of scheduling starting time dependent tasks with release timesInformation Processing Letters, 1998
- Scheduling jobs with step-deterioration; Minimizing makespan on a single- and multi-machineComputers & Industrial Engineering, 1995
- Single machine scheduling with start time dependent processing times: Some solvable casesEuropean Journal of Operational Research, 1994
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979