Off-line admission control for general scheduling problems

DOI<365::AID-JOS56>3.0.CO;2-P 10.1002/1099-1425(200011/12)3:6<365::AID-JOS56>3.0.CO;2-PzbMath0969.90047OpenAlexW2093274793MaRDI QIDQ1592760

R. N. Uma, Cynthia A. Phillips, Joel M. Wein

Publication date: 25 January 2001

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/1099-1425(200011/12)3:6<365::aid-jos56>3.0.co;2-p

zbMATH Keywords

schedulingapproximation algorithmadmission control

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Resource allocation with time intervals ⋮ A survey on offline scheduling with rejection ⋮ Approximations for generalized unsplittable flow on paths with application to power systems optimization ⋮ A combinatorial flow-based formulation for temporal bin packing problems ⋮ On improved interval cover mechanisms for crowdsourcing markets ⋮ Real-time scheduling to minimize machine busy times ⋮ Resource allocation in bounded degree trees

Cites Work

• Randomized rounding: A technique for provably good algorithms and algorithmic proofs
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Single machine scheduling with deadlines, release and due dates
• Task Scheduling in Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Off-line admission control for general scheduling problems