Pages that link to "Item:Q5900516"
From MaRDI portal
The following pages link to A new average case analysis for completion time scheduling (Q5900516):
Displayed 8 items.
- The expected asymptotical ratio for preemptive stochastic online problem (Q391147) (← links)
- On robust online scheduling algorithms (Q539452) (← links)
- Average-case competitive analyses for one-way trading (Q626450) (← links)
- Evaluating the quality of online optimization algorithms by discrete event simulation (Q1642796) (← links)
- An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
- Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
- Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison (Q3541114) (← links)
- Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality (Q5131543) (← links)