Off-line admission control for general scheduling problems

DOI10.1002/1099-1425(200011/12)3:6%3C365::AID-JOS56%3E3.0.CO;2-PMaRDI QIDQ1592760zbMATH OpenOpenAlexFDO

Authors Cynthia Phillips, R. N. Uma, Joel 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%3C365::aid-jos56%3E3.0.co;2-p

zbMATH Keywords

approximation algorithmschedulingadmission control

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Publication:4952713
• An experimental study of LP-based approximation algorithms for scheduling problems
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Scheduling jobs that arrive over time
• scientific article; zbMATH DE number 871909

Cites work

• scientific article; zbMATH DE number 1187167 (Why is no real title available?)
• scientific article; zbMATH DE number 1303566 (Why is no real title available?)
• scientific article; zbMATH DE number 1303587 (Why is no real title available?)
• scientific article; zbMATH DE number 1559529 (Why is no real title available?)
• scientific article; zbMATH DE number 2102785 (Why is no real title available?)
• scientific article; zbMATH DE number 871909 (Why is no real title available?)
• scientific article; zbMATH DE number 6472636 (Why is no real title available?)
• scientific article; zbMATH DE number 6472638 (Why is no real title available?)
• 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

Cited in

(10)

• A survey on offline scheduling with rejection
• Real-time scheduling to minimize machine busy times
• Exact admission-control for integrated aperiodic and periodic tasks
• Admission control to minimize rejections and online set cover with repetitions
• On improved interval cover mechanisms for crowdsourcing markets
• Resource allocation in bounded degree trees
• scientific article; zbMATH DE number 1445390 (Why is no real title available?)
• A combinatorial flow-based formulation for temporal bin packing problems
• Resource allocation with time intervals
• Approximations for generalized unsplittable flow on paths with application to power systems optimization

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

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