Pages that link to "Item:Q2819592"
From MaRDI portal
The following pages link to Approximating the throughput of multiple machines under real-time scheduling (Q2819592):
Displaying 12 items.
- Approximation algorithms for scheduling real-time jobs with multiple feasible intervals (Q853634) (← links)
- Online real-time preemptive scheduling of jobs with deadlines on multiple machines (Q1348736) (← links)
- The lazy bureaucrat scheduling problem (Q1398377) (← links)
- Multi-phase algorithms for throughput maximization for real-time scheduling (Q1587588) (← links)
- Aligning two fragmented sequences (Q1868717) (← links)
- Busy time scheduling on a bounded number of machines (extended abstract) (Q2405306) (← links)
- Approximating the throughput of multiple machines in real-time scheduling (Q2784456) (← links)
- Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)
- Approximating Real-Time Scheduling on Identical Machines (Q5405072) (← links)
- Maximizing the Throughput of Multiple Machines On-Line (Q5434381) (← links)
- Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)
- Approximations for Throughput Maximization (Q6492088) (← links)