Resource allocation with time intervals

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

Andreas Darmann, Joachim Schauer, Ulrich Pferschy

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 algorithmresource allocationunsplittable flowinterval schedulingproper intervals

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Optimal interval scheduling with a resource constraint ⋮ General caching is hard: even with small pages ⋮ A combinatorial flow-based formulation for temporal bin packing problems ⋮ Improved algorithms for scheduling unsplittable flows on paths ⋮ A fully distributed learning algorithm for power allocation in heterogeneous networks ⋮ Complex-demand scheduling problem with application in smart grid ⋮ On the complexity of interval scheduling with a resource constraint ⋮ Directed-bond percolation subjected to synthetic compressible velocity fluctuations: renormalization group approach ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Resource allocation with time intervals