On index priority sequencing rules for scheduling with time-dependent job processing times
- 1 September 2013
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 41 (5) , 445-448
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A note on the optimality of index priority rules for search and sequencing problemsNaval Research Logistics (NRL), 2011
- A state-of-the-art review on scheduling with learning effectsEuropean Journal of Operational Research, 2008
- A concise survey of scheduling with time-dependent processing timesEuropean Journal of Operational Research, 2004
- Minimizing the total weighted completion time of deteriorating jobsInformation Processing Letters, 2002
- Scheduling with time dependent processing times: Review and extensionsJournal of the Operational Research Society, 1999
- Dynamic Recomputation Cannot Extend the Optimality-Range of Priority IndicesOperations Research, 1994
- Scheduling jobs under simple linear deteriorationComputers & Operations Research, 1994
- Scheduling Deteriorating Jobs on a Single ProcessorOperations Research, 1990
- Scheduling Independent Tasks on Parallel ProcessorsManagement Science, 1966
- Optimal two‐ and three‐stage production schedules with setup times includedNaval Research Logistics Quarterly, 1954