Approximating the throughput of multiple machines under real-time scheduling
From MaRDI portal
Recommendations
- Approximating the throughput of multiple machines in real-time scheduling
- Maximizing the Throughput of Multiple Machines On-Line
- Multi-phase algorithms for throughput maximization for real-time scheduling
- Approximating Real-Time Scheduling on Identical Machines
- Throughput maximization of real-time scheduling with batching
Cited in
(15)- Online real-time preemptive scheduling of jobs with deadlines on multiple machines
- The lazy bureaucrat scheduling problem
- Multi-phase algorithms for throughput maximization for real-time scheduling
- Aligning two fragmented sequences
- Busy time scheduling on a bounded number of machines (extended abstract)
- Improvements in throughout maximization for real-time scheduling
- scientific article; zbMATH DE number 2119735 (Why is no real title available?)
- Throughput maximization of real-time scheduling with batching
- Approximation algorithms for maximum weight k-coverings of graphs by packings
- Breaking 1-1/e barrier for nonpreemptive throughput maximization
- Approximating Real-Time Scheduling on Identical Machines
- Maximizing the Throughput of Multiple Machines On-Line
- Maximum max-k-clique subgraphs in cactus subtree graphs
- Approximations for Throughput Maximization
- Approximation algorithms for scheduling real-time jobs with multiple feasible intervals
This page was built for publication: Approximating the throughput of multiple machines under real-time scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819592)