The following pages link to On randomized online scheduling (Q3579202):
Displaying 22 items.
- New upper and lower bounds for online scheduling with machine cost (Q429648) (← links)
- Semi-online scheduling revisited (Q442235) (← links)
- Online algorithms with advice for bin packing and scheduling problems (Q496020) (← links)
- On robust online scheduling algorithms (Q539452) (← links)
- Efficient job scheduling algorithms with multi-type contentions (Q813335) (← links)
- Scheduling with testing on multiple identical parallel machines (Q832831) (← links)
- Online parallel machines scheduling with two hierarchies (Q837151) (← links)
- Online scheduling with reassignment (Q935241) (← links)
- Randomized priority algorithms (Q974749) (← links)
- Extension of algorithm list scheduling for a semi-online scheduling problem (Q1011847) (← links)
- Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Improved lower bounds for online scheduling to minimize total stretch (Q1680548) (← links)
- Multiprofessor scheduling (Q1686063) (← links)
- Pseudo lower bounds for online parallel machine scheduling (Q1785411) (← links)
- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing (Q2168774) (← links)
- Improved randomized online scheduling of intervals and jobs (Q2254495) (← links)
- Semi-online scheduling jobs with tightly-grouped processing times on three identical machines (Q2565855) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
- Fair Scheduling via Iterative Quasi-Uniform Sampling (Q3304734) (← links)
- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs (Q3602829) (← links)
