Pages that link to "Item:Q4962651"
From MaRDI portal
The following pages link to A New Approach to Online Scheduling (Q4962651):
Displaying 14 items.
- Competitive on-line scheduling of continuous-media streams (Q1608317) (← links)
- Automated competitive analysis of real-time scheduling with graph games (Q1698779) (← links)
- Improved competitive algorithms for online scheduling with partial job values (Q1884846) (← links)
- Ronald Graham: laying the foundations of online optimization (Q1946024) (← 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)
- On-line scheduling with monotone subsequence constraints (Q2319898) (← links)
- A polynomial-time approximation scheme for the airplane refueling problem (Q2327962) (← links)
- An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
- Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling (Q3527235) (← links)
- Comparing deterministic, robust and online scheduling using entropy (Q4681156) (← links)
- Algorithms – ESA 2004 (Q5464592) (← links)
- Select and permute: an improved online framework for scheduling to minimize weighted completion time (Q5919414) (← links)
- On competitive analysis for polling systems (Q6072151) (← links)