Stochastic Scheduling on Unrelated Machines
From MaRDI portal
Publication:2965523
Recommendations
- Unrelated machine scheduling with stochastic processing times
- Stochastic online scheduling on unrelated machines
- Scheduling Unrelated Machines by Randomized Rounding
- On stochastic machine scheduling with general distributional assumptions
- Randomized selection algorithm for online stochastic unrelated machines scheduling
- A stochastic single machine scheduling with random processing time
- scientific article; zbMATH DE number 437570
Cited in
(13)- Unrelated machine scheduling with stochastic processing times
- A dynamic heuristic for the stochastic unrelated parallel machine scheduling problem
- Static routing in stochastic scheduling: performance guarantees and asymptotic optimality
- Stochastic and robust scheduling in the cloud
- An improved greedy algorithm for stochastic online scheduling on unrelated machines
- Stability of scheduling with random processing times on one machine
- Stochastic load balancing on unrelated machines
- Randomized selection algorithm for online stochastic unrelated machines scheduling
- Scheduling with explorable uncertainty
- On index policies for stochastic minsum scheduling
- Stochastic online scheduling on unrelated machines
- Stochastic task networks -- trading performance for stability
- Universal sequencing on an unreliable machine
This page was built for publication: Stochastic Scheduling on Unrelated Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965523)
