Models and Algorithms for Stochastic Online Scheduling
From MaRDI portal
Recommendations
- Stochastic Online Scheduling Revisited
- Online scheduling on multiple resources under stochastic conditions
- Approximation and Online Algorithms
- Approximation in Preemptive Stochastic Online Scheduling
- Stochastic online scheduling on unrelated machines
- Coping with Incomplete Information in Scheduling — Stochastic and Online Models
- Online Interval Scheduling: Randomized and Multiprocessor Cases
- Online interval scheduling: Randomized and multiprocessor cases
- On robust online scheduling algorithms
- Randomized online interval scheduling
Cited in
(45)- A novel parallel quantum genetic algorithm for stochastic job shop scheduling
- A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
- OL-DEC-MDP model for multiagent online scheduling with a time-dependent probability of success
- Online scheduling for outpatient services with heterogeneous patients and physicians
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- Randomized selection algorithm for online stochastic unrelated machines scheduling
- An adversarial model for scheduling with testing
- Analysis of computer job control under uncertainty
- On index policies for stochastic minsum scheduling
- Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines
- An improved greedy algorithm for stochastic online scheduling on unrelated machines
- Online scheduling in manufacturing. A cumulative delay approach
- Unrelated machine scheduling with stochastic processing times
- Dynamic resource allocation to improve emergency department efficiency in real time
- Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling
- Scheduling with compressible and stochastic release dates
- Online appointment scheduling in the random order model
- Online scheduling on multiple resources under stochastic conditions
- The expected asymptotical ratio for preemptive stochastic online problem
- Dynamic fleet scheduling with uncertain demand and customer flexibility
- Comparing deterministic, robust and online scheduling using entropy
- Multi-priority online scheduling with cancellations
- Stochastic load balancing on unrelated machines
- Scheduling with explorable uncertainty
- Greed works -- online algorithms for unrelated machine stochastic scheduling
- Randomized mechanism design for decentralized network scheduling
- A tight 2-approximation for preemptive stochastic scheduling
- Coping with Incomplete Information in Scheduling — Stochastic and Online Models
- On robust online scheduling algorithms
- Stochastic Online Scheduling Revisited
- Real time stochastic scheduling in broadcast systems with decentralized data storage
- Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems
- Improved bounds for stochastic extensible bin packing under distributional assumptions
- Dynamic surgery management under uncertainty
- Dynamic scheduling with uncertain job types
- Average-case competitive analyses for one-way trading
- Scheduling and packing under uncertainty
- The power of proportional fairness for nonclairvoyant polytope scheduling
- Fifty years of research in scheduling -- theory and applications
- Online order acceptance and scheduling in a single machine environment
- Configuration balancing for stochastic requests
- Sequencing stochastic jobs with a single sample
- Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
- Online stochastic reservation systems
- Preemptive stochastic online scheduling on two uniform machines
This page was built for publication: Models and Algorithms for Stochastic Online Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387994)