Complexity and approximability of scheduling resumable proportionally deteriorating jobs
- 1 January 2010
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 200 (1) , 305-308
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Scheduling deteriorating jobs subject to job or machine availability constraintsEuropean Journal of Operational Research, 2007
- Scheduling linear deteriorating jobs with an availability constraint on a single machineTheoretical Computer Science, 2006
- A concise survey of scheduling with time-dependent processing timesEuropean Journal of Operational Research, 2004
- Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machineInformation Processing Letters, 2003
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?INFORMS Journal on Computing, 2000
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1981