Pages that link to "Item:Q1029703"
From MaRDI portal
The following pages link to Online interval scheduling: Randomized and multiprocessor cases (Q1029703):
Displaying 23 items.
- Online scheduling of jobs with fixed start times on related machines (Q261353) (← links)
- Online interval scheduling on a single machine with finite lookahead (Q339562) (← links)
- On-line scheduling of equal-length intervals on parallel machines (Q436333) (← links)
- Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs (Q479220) (← links)
- Interval scheduling on related machines (Q547142) (← links)
- Online scheduling of equal-processing-time task systems (Q935146) (← links)
- Improved randomized results for the interval selection problem (Q986549) (← links)
- Randomized online interval scheduling (Q1273096) (← links)
- Improved bounds for randomized preemptive online matching (Q1706142) (← links)
- Online interval scheduling with a bounded number of failures (Q1707823) (← links)
- Online C-benevolent job scheduling on multiple machines (Q1744621) (← links)
- Note on scheduling intervals on-line (Q1805461) (← links)
- Randomized online algorithms for maximizing busy time interval scheduling (Q1909593) (← links)
- Primal-dual analysis for online interval scheduling problems (Q2182859) (← links)
- Improved randomized online scheduling of intervals and jobs (Q2254495) (← links)
- Online interval scheduling to maximize total satisfaction (Q2285162) (← links)
- Online interval scheduling on two related machines: the power of lookahead (Q2424805) (← links)
- An improved randomized on-line algorithm for a weighted interval selection problem (Q2464426) (← links)
- A note on the online interval scheduling secretary problem (Q2670476) (← links)
- Competitive Algorithms for Cottage Rental (Q3439500) (← links)
- Comparing deterministic, robust and online scheduling using entropy (Q4681156) (← links)
- Models and Algorithms for Stochastic Online Scheduling (Q5387994) (← links)
- Approximation algorithms for stochastic online matching with reusable resources (Q6046972) (← links)