Pages that link to "Item:Q2385472"
From MaRDI portal
The following pages link to Separating online scheduling algorithms with the relative worst order ratio (Q2385472):
Displaying 12 items.
- A theoretical comparison of LRU and LRU-K (Q611043) (← links)
- A best on-line algorithm for the single machine parallel-batch scheduling with restricted delivery times (Q841603) (← links)
- The relative worst-order ratio applied to paging (Q881599) (← links)
- Comparing first-fit and next-fit for online edge coloring (Q964390) (← links)
- Scheduling jobs on grid processors (Q973018) (← links)
- Online scheduling in a parallel batch processing system to minimize makespan using restarts (Q1022602) (← links)
- Online-bounded analysis (Q1617274) (← links)
- List factoring and relative worst order analysis (Q1950393) (← links)
- Comparing online algorithms for bin packing problems (Q2434261) (← links)
- A new variable-sized bin packing problem (Q2434283) (← links)
- A Survey of Algorithms and Models for List Update (Q2848979) (← links)
- Online Bounded Analysis (Q5740182) (← links)
