The following pages link to (Q3128889):
Displaying 50 items.
- On-line scheduling with setup costs (Q294721) (← links)
- Online scheduling with interval conflicts (Q372978) (← links)
- Online selection of intervals and \(t\)-intervals (Q391644) (← links)
- Dynamic algorithms for monotonic interval scheduling problem (Q476865) (← links)
- Online optimization of busy time on parallel machines (Q477193) (← links)
- Online time-constrained scheduling in linear and ring networks (Q616984) (← links)
- Efficient job scheduling algorithms with multi-type contentions (Q813335) (← links)
- A randomized algorithm for online unit clustering (Q839627) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- A near optimal scheduler for on-demand data broadcasts (Q935145) (← links)
- Online scheduling with reassignment (Q935241) (← links)
- A preemptive algorithm for maximizing disjoint paths on trees (Q970615) (← links)
- Online interval scheduling: Randomized and multiprocessor cases (Q1029703) (← links)
- Randomized online interval scheduling (Q1273096) (← links)
- Online real-time preemptive scheduling of jobs with deadlines on multiple machines (Q1348736) (← links)
- Sharing video on demand (Q1399105) (← links)
- On-line scheduling with tight deadlines. (Q1401244) (← links)
- Competitive on-line scheduling of continuous-media streams (Q1608317) (← 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)
- Online deadline scheduling on faster machines. (Q1853172) (← links)
- Online independent sets. (Q1853575) (← links)
- Scheduling broadcasts with deadlines (Q1884847) (← links)
- Randomized online algorithms for maximizing busy time interval scheduling (Q1909593) (← links)
- Online scheduling of car-sharing request pairs between two locations (Q2156295) (← links)
- Online two-way trading: randomization and advice (Q2219058) (← links)
- Online interval scheduling to maximize total satisfaction (Q2285162) (← links)
- Advice complexity of maximum independent set in sparse and bipartite graphs (Q2344218) (← links)
- Online interval scheduling on two related machines: the power of lookahead (Q2424805) (← links)
- Aggressive online deadline scheduling (Q2845522) (← links)
- Online Optimization of Busy Time on Parallel Machines (Q2898056) (← links)
- Optimal Allocation for Chunked-Reward Advertising (Q2937765) (← links)
- The Temp Secretary Problem (Q3452826) (← links)
- A Randomized Algorithm for Online Scheduling with Interval Conflicts (Q3460709) (← links)
- An Optimal Strategy for Online Non-uniform Length Order Scheduling (Q3511440) (← links)
- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees (Q3512469) (← links)
- Interval scheduling: A survey (Q3524590) (← links)
- On Job Scheduling with Preemption Penalties (Q3638458) (← links)
- (Q4829009) (← links)
- On-line scheduling with hard deadlines (Q5096944) (← links)
- Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization (Q5130573) (← links)
- Time-Multiplexed Online Checking (Q5280529) (← links)
- (Q5702317) (← links)
- Optimally Handling Commitment Issues in Online Throughput Maximization (Q5874511) (← links)
- Packing random intervals (Q5917633) (← links)
- A general framework for handling commitment in online throughput maximization (Q5918914) (← links)
- Approximation algorithms for stochastic online matching with reusable resources (Q6046972) (← links)
- (Q6065401) (← links)
