Pages that link to "Item:Q1612009"
From MaRDI portal
The following pages link to Randomized algorithms for on-line scheduling problems: How low can't you go? (Q1612009):
Displaying 14 items.
- A lower bound for randomized on-line multiprocessor scheduling (Q287130) (← links)
- Online \(k\)-server routing problems (Q839628) (← links)
- LP-based online scheduling: From single to parallel machines (Q1013970) (← links)
- A lower bound for randomized on-line scheduling algorithms (Q1336752) (← links)
- Online scheduling problems with flexible release dates: applications to infrastructure restoration (Q1651574) (← links)
- Lower bounds for on-line single-machine scheduling. (Q1874403) (← links)
- Randomized online scheduling with delivery times (Q1970335) (← links)
- Metrical service systems with multiple servers (Q2258084) (← links)
- Online scheduling on two parallel machines with release dates and delivery times (Q2355989) (← links)
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates (Q2490322) (← links)
- An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
- Online Scheduling on Two Parallel Machines with Release Times and Delivery Times (Q2867111) (← links)
- An optimal online algorithm for scheduling two machines with release times (Q5958718) (← links)
- On competitive analysis for polling systems (Q6072151) (← links)