Scheduling Resources for Throughput Maximization
From MaRDI portal
Publication:3088087
DOI10.1007/978-3-642-22935-0_10zbMATH Open1343.90032OpenAlexW1828566370MaRDI QIDQ3088087FDOQ3088087
Authors: Venkatesan T. Chakaravarthy, Amit Kumar, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal 
Publication date: 17 August 2011
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22935-0_10
Recommendations
- Allocation of interdependent resources for maximal throughput
- Throughput maximization of real-time scheduling with batching
- scientific article; zbMATH DE number 2119735
- Simultaneous versus sequential scheduling of multiple resources which constrain system throughput
- Open Problems in Throughput Scheduling
- Optimal resource profiles for program scheduling
- Simultaneous Resource Scheduling to Minimize Weighted Flow Times
Cites Work
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Scheduling with limited machine availability
- Multi-budgeted matchings and matroid intersection via dependent rounding
- Title not available (Why is that?)
- A unified approach to approximating resource allocation and scheduling
- Minimizing the makespan for the flow shop scheduling problem with availability constraints.
- Title not available (Why is that?)
- A constant factor approximation algorithm for unsplittable flow on paths
- Approximation algorithms for the unsplittable flow problem
- A quasi-PTAS for unsplittable flow on line graphs
- Multicommodity demand flow in a tree and packing integer programs
- A near-linear time constant factor algorithm for unsplittable flow problem on line with bag constraints
Cited In (3)
This page was built for publication: Scheduling Resources for Throughput Maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088087)
