Resource allocation with time intervals

DOI10.1016/J.TCS.2010.08.028MaRDI QIDQ606987zbMATH OpenOpenAlexWikidataFDO

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

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2086936
• An improved approximation algorithm for \textsc{Resource Allocation}
• Flexible resource allocation to interval jobs
• Optimal interval scheduling with a resource constraint
• Improved algorithm for resource allocation problems

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• scientific article; zbMATH DE number 2080220 (Why is no real title available?)
• scientific article; zbMATH DE number 7051239 (Why is no real title available?)
• scientific article; zbMATH DE number 2086936 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A quasi-PTAS for unsplittable flow on line graphs
• A unified approach to approximating resource allocation and scheduling
• Algorithmic graph theory and perfect graphs
• Approximation algorithms for the unsplittable flow problem
• Graph theory
• Interval scheduling on identical machines
• Interval scheduling: A survey
• Maximizing the value of a space mission
• Off-line admission control for general scheduling problems
• On the complexity of adjacent resource scheduling
• Scheduling jobs with fixed start and end times
• The Fixed Job Schedule Problem with Working-Time Constraints
• The Temporal Knapsack Problem and Its Solution
• The clique-separator graph for chordal graphs

Cited in

(20)

• Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms
• Resource Allocation Among Simulation Time Steps
• Improved algorithms for scheduling unsplittable flows on paths
• scientific article; zbMATH DE number 7278054 (Why is no real title available?)
• Improved algorithm for resource allocation problems
• Improved algorithms for resource allocation under varying capacity
• Understanding the time dimension in resource management
• On the complexity of interval scheduling with a resource constraint
• Improved algorithms for resource allocation under varying capacity
• A combinatorial flow-based formulation for temporal bin packing problems
• Resource holding times: Computation and optimization
• An improved approximation algorithm for \textsc{Resource Allocation}
• Directed-bond percolation subjected to synthetic compressible velocity fluctuations: renormalization group approach
• Optimal interval scheduling with a resource constraint
• scientific article; zbMATH DE number 2086936 (Why is no real title available?)
• A fully distributed learning algorithm for power allocation in heterogeneous networks
• Flexible resource allocation to interval jobs
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• Human Time Allocation in Time-based Analog of Concurrent Interval-ratio Schedules.
• Allocations with reflection, waiting time

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606987)