Pages that link to "Item:Q1206445"
From MaRDI portal
The following pages link to On the competitiveness of on-line real-time task scheduling (Q1206445):
Displayed 33 items.
- Online scheduling of jobs with fixed start times on related machines (Q261353) (← links)
- Online scheduling with preemption or non-completion penalties (Q398912) (← links)
- Online time-constrained scheduling in linear and ring networks (Q616984) (← links)
- Random trees in queueing systems with deadlines (Q672995) (← links)
- Lower bounds on online deadline scheduling with preemption penalties (Q975450) (← links)
- Competitive analysis of online real-time scheduling algorithms under hard energy constraint (Q993512) (← links)
- Variable sized online interval coloring with bandwidth (Q1024785) (← links)
- Online interval scheduling: Randomized and multiprocessor cases (Q1029703) (← links)
- Randomized online interval scheduling (Q1273096) (← links)
- Scheduling parallel tasks with individual deadlines (Q1285585) (← links)
- MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling (Q1330422) (← links)
- Online real-time preemptive scheduling of jobs with deadlines on multiple machines (Q1348736) (← links)
- A 2.79 competitive on-line algorithm for two processor real-time systems with uniform value density (Q1370302) (← links)
- On-line scheduling with tight deadlines. (Q1401244) (← links)
- Preemptive scheduling in overloaded systems. (Q1401985) (← links)
- Approximating scheduling for multimedia applications under overload conditions (Q1606211) (← links)
- Competitive on-line scheduling of continuous-media streams (Q1608317) (← links)
- Automated competitive analysis of real-time scheduling with graph games (Q1698779) (← links)
- Scheduling multipacket frames with frame deadlines (Q1702660) (← links)
- Improved bounds for randomized preemptive online matching (Q1706142) (← links)
- Online C-benevolent job scheduling on multiple machines (Q1744621) (← links)
- Online scheduling with partial job values: does timesharing or randomization help? (Q1879362) (← links)
- Improved competitive algorithms for online scheduling with partial job values (Q1884846) (← links)
- A competitive algorithm for throughput maximization on identical machines (Q2164724) (← links)
- Improved randomized online scheduling of intervals and jobs (Q2254495) (← links)
- ON THE LOWER BOUND OF THE COMPETITIVE RATIO FOR THE WEIGHTED ONLINE ROOMMATES PROBLEM (Q3575383) (← links)
- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs (Q3602829) (← links)
- ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO (Q5462125) (← links)
- On the Competitiveness of Online Real-Time Scheduling with Rate of Progress Guarantees (Q5696914) (← links)
- Optimally Handling Commitment Issues in Online Throughput Maximization (Q5874511) (← links)
- A general framework for handling commitment in online throughput maximization (Q5918914) (← links)
- (Q6065401) (← links)
- Online Throughput Maximization on Unrelated Machines: Commitment is No Burden (Q6075745) (← links)