Pages that link to "Item:Q5387994"
From MaRDI portal
The following pages link to Models and Algorithms for Stochastic Online Scheduling (Q5387994):
Displaying 36 items.
- Dynamic resource allocation to improve emergency department efficiency in real time (Q323566) (← links)
- Scheduling with compressible and stochastic release dates (Q336364) (← links)
- The expected asymptotical ratio for preemptive stochastic online problem (Q391147) (← links)
- Dynamic fleet scheduling with uncertain demand and customer flexibility (Q395693) (← links)
- On robust online scheduling algorithms (Q539452) (← links)
- Real time stochastic scheduling in broadcast systems with decentralized data storage (Q610434) (← links)
- Average-case competitive analyses for one-way trading (Q626450) (← links)
- Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines (Q763104) (← links)
- Online stochastic reservation systems (Q846144) (← links)
- Preemptive stochastic online scheduling on two uniform machines (Q976122) (← links)
- A novel parallel quantum genetic algorithm for stochastic job shop scheduling (Q1018336) (← links)
- A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem (Q1046710) (← links)
- OL-DEC-MDP model for multiagent online scheduling with a time-dependent probability of success (Q1719084) (← links)
- Online scheduling for outpatient services with heterogeneous patients and physicians (Q1740403) (← links)
- Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
- Randomized selection algorithm for online stochastic unrelated machines scheduling (Q2082193) (← links)
- An adversarial model for scheduling with testing (Q2211361) (← links)
- Analysis of computer job control under uncertainty (Q2263387) (← links)
- On index policies for stochastic minsum scheduling (Q2294301) (← links)
- Performance analysis of fixed assignment policies for stochastic online scheduling on uniform parallel machines (Q2664447) (← links)
- An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
- Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
- Generalizing the Kawaguchi-Kyan bound to stochastic parallel machine scheduling (Q3304142) (← links)
- Online Appointment Scheduling in the Random Order Model (Q3452831) (← links)
- Comparing deterministic, robust and online scheduling using entropy (Q4681156) (← links)
- Multi-Priority Online Scheduling with Cancellations (Q4969311) (← links)
- Stochastic Load Balancing on Unrelated Machines (Q4991668) (← links)
- Scheduling with explorable uncertainty (Q4993294) (← links)
- Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling (Q5119844) (← links)
- Randomized mechanism design for decentralized network scheduling (Q5135252) (← links)
- A Tight 2-Approximation for Preemptive Stochastic Scheduling (Q5247621) (← links)
- Coping with Incomplete Information in Scheduling — Stochastic and Online Models (Q5391870) (← links)
- Stochastic Online Scheduling Revisited (Q5505682) (← links)
- Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems (Q6106966) (← links)
- Dynamic surgery management under uncertainty (Q6112637) (← links)
- Dynamic scheduling with uncertain job types (Q6167855) (← links)
