Resource allocation with time intervals

DOI10.1016/j.tcs.2010.08.028zbMath1208.90058WikidataQ61638327 ScholiaQ61638327MaRDI QIDQ606987

Andreas Darmann, Ulrich Pferschy, Joachim Schauer

Publication date: 19 November 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.08.028

zbMATH Keywords

approximation algorithm; resource allocation; unsplittable flow; interval scheduling; proper intervals

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

Related Items

Optimal interval scheduling with a resource constraint, On the complexity of interval scheduling with a resource constraint, Complex-demand scheduling problem with application in smart grid, Directed-bond percolation subjected to synthetic compressible velocity fluctuations: renormalization group approach, General caching is hard: even with small pages

Cites Work

• Approximation algorithms for the unsplittable flow problem
• On the complexity of adjacent resource scheduling
• The clique-separator graph for chordal graphs
• Scheduling jobs with fixed start and end times
• Maximizing the value of a space mission
• Off-line admission control for general scheduling problems
• Algorithmic graph theory and perfect graphs
• Interval scheduling on identical machines
• A quasi-PTAS for unsplittable flow on line graphs
• Interval scheduling: A survey
• The Fixed Job Schedule Problem with Working-Time Constraints
• The Temporal Knapsack Problem and Its Solution
• A unified approach to approximating resource allocation and scheduling
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item