Approximating the throughput of multiple machines in real-time scheduling
From MaRDI portal
Recommendations
Cited in
(55)- Bandwidth-constrained allocation in grid computing
- Priority algorithms for the subset-sum problem
- Multi-phase algorithms for throughput maximization for real-time scheduling
- Improved algorithms for resource allocation under varying capacity
- High-performance technique for satellite range scheduling
- A truthful mechanism for value-based scheduling in cloud computing
- Online C-benevolent job scheduling on multiple machines
- Conversion of coloring algorithms into maximum weight independent set algorithms
- Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs
- Inverse interval scheduling via reduction on a single machine
- The quality of equilibria for set packing and throughput scheduling games
- Scheduling split intervals with non-uniform demands
- Fast primal-dual distributed algorithms for scheduling and matching problems
- Minimizing the number of tardy jobs in two-machine settings with common due date
- AFSCN scheduling: how the problem and solution have evolved
- Grasp and delivery for moving objects on broken lines
- On Lagrangian relaxation for constrained maximization and reoptimization problems
- Approximating the throughput of multiple machines under real-time scheduling
- Primal-dual approximation algorithms for a packing-covering pair of problems
- Improvements in throughout maximization for real-time scheduling
- Resource loading with time windows
- On Lagrangian Relaxation and Subset Selection Problems
- Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
- Coordinated scheduling of production and delivery with production window and delivery capacity constraints
- scientific article; zbMATH DE number 2119735 (Why is no real title available?)
- Bandwidth allocation in cellular networks with multiple interferences
- Throughput maximization of real-time scheduling with batching
- Breaking 1-1/e barrier for nonpreemptive throughput maximization
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
- Approximating Real-Time Scheduling on Identical Machines
- Maximizing the Throughput of Multiple Machines On-Line
- Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
- Throughput scheduling with equal additive laxity
- Cost-sharing games in real-time scheduling systems
- Cost-sharing games in real-time scheduling systems
- Throughput scheduling with equal additive laxity
- scientific article; zbMATH DE number 7765369 (Why is no real title available?)
- Online Throughput Maximization on Unrelated Machines: Commitment is No Burden
- Maximizing Throughput in Flow Shop Real-Time Scheduling
- Approximations for Throughput Maximization
- Scheduling-location problem with drones
- The preemptive resource allocation problem
- Approximation algorithms for maximum weighted throughput on unrelated machines
- On the approximability of unsplittable flow on a path with time windows
- Approximation algorithms for maximum weighted throughput on unrelated machines
- Fair and efficient cake division with connected pieces
- On the Price of Anarchy of cost-sharing in real-time scheduling systems
- Graph colouring approaches for a satellite range scheduling problem
- Approximation algorithms for scheduling real-time jobs with multiple feasible intervals
- Analysis of bounds for a capacitated single-item lot-sizing problem
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry
- Bicriteria scheduling for contiguous and non contiguous parallel tasks
- Integrated production and delivery scheduling with disjoint windows
- Randomized priority algorithms
This page was built for publication: Approximating the throughput of multiple machines in real-time scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2784456)
