Scheduling Stochastic Jobs on Parallel Machines to Minimize Makespan or Flowtime
- 1 January 1982
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Scheduling jobs by stochastic processing requirements on parallel machines to minimize makespan or flowtimeJournal of Applied Probability, 1982
- Scheduling Jobs with Exponential Processing and Arrival Times on Identical Processors so as to Minimize the Expected MakespanMathematics of Operations Research, 1981
- 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 non-identical processors to minimize various cost functionsJournal of Applied Probability, 1980
- Scheduling tasks with exponential service times on parallel processorsJournal of Applied Probability, 1979
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time DisciplineOperations Research, 1968
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959
- A Renewal Problem with Bulk Ordering of ComponentsJournal of the Royal Statistical Society Series B: Statistical Methodology, 1959