Improved On-Line Broadcast Scheduling with Deadlines
From MaRDI portal
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)
Recommendations
Cited in
(16)- Online interval scheduling: Randomized and multiprocessor cases
- Scheduling broadcasts with deadlines
- On-line production order scheduling with preemption penalties
- Improved online scheduling in maximizing throughput of equal length jobs
- Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting
- ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES
- An Optimal Strategy for Online Non-uniform Length Order Scheduling
- Improved Randomized Online Scheduling of Unit Length Intervals and Jobs
- On Job Scheduling with Preemption Penalties
- Myopic policies for non-preemptive scheduling of jobs with decaying value
- Computing and Combinatorics
- Algorithms - ESA 2003
- Improved on-line broadcast scheduling with deadlines
- A near optimal scheduler for on-demand data broadcasts
- Lower bounds on online deadline scheduling with preemption penalties
- A note on on-line broadcast scheduling with deadlines
This page was built for publication: Improved On-Line Broadcast Scheduling with Deadlines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3591311)