On index policies for stochastic minsum scheduling
- 1 May 2019
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 47 (3) , 213-218
Abstract
No abstract availableKeywords
Funding Information
- Alexander von Humboldt-Stiftung
- Deutsche Forschungsgemeinschaft (ME 3825/1, SFB/TR 89)
- Bundesministerium für Forschung, Technologie und Raumfahrt
This publication has 17 references indexed in Scilit:
- Stochastic scheduling: A short history of index policies and new approaches to index generation for dynamic resource allocationJournal of Scheduling, 2013
- Stochastic Machine Scheduling with Precedence ConstraintsSIAM Journal on Computing, 2005
- Approximation in stochastic schedulingJournal of the ACM, 1999
- Scheduling jobs with stochastically ordered processing times on parallel machines to minimize expected flowtimeJournal of Applied Probability, 1986
- Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtimeJournal of Applied Probability, 1982
- Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or MakespanJournal of the ACM, 1981
- Scheduling tasks with exponential service times on parallel processorsJournal of Applied Probability, 1979
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956