Job scheduling to minimize expected weighted flowtime on uniform processors
From MaRDI portal
Publication:1111928
DOI10.1016/0167-6911(88)90009-6zbMath0658.90051OpenAlexW2020231705MaRDI QIDQ1111928
Publication date: 1988
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6911(88)90009-6
sequencingstochastic dynamic programmingsequential assignmentMarkov decision problemnonpreemptive schedulingnonidentical processorstotal expected holding costs
Stochastic programming (90C15) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40)
Related Items (7)
Scheduling jobs on heterogeneous processors ⋮ SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS ⋮ Minimizing expected makespans of multi-priority classes of jobs on uniform processors ⋮ Managing Queues with Heterogeneous Servers ⋮ Analysis of computer job control under uncertainty ⋮ Stochastic scheduling on parallel machines to minimize discounted holding costs ⋮ Stochastically Minimizing Total Delay of Jobs Subject to Random Deadlines
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on Optimal control of a queueing system with two heterogeneous servers
- Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal
- The cμ rule revisited
- A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors
- Optimal control of a queueing system with two heterogeneous servers
- Individually optimal routing in parallel systems
- Minimizing expected makespans on uniform processor systems
- Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions
- A Sequential Stochastic Assignment Problem
This page was built for publication: Job scheduling to minimize expected weighted flowtime on uniform processors
