Improved on-line broadcast scheduling with deadlines
From MaRDI portal
Publication:835602
Recommendations
Cites work
- scientific article; zbMATH DE number 1670667 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 2119692 (Why is no real title available?)
- scientific article; zbMATH DE number 1445348 (Why is no real title available?)
- A tight lower bound for job scheduling with cancellation
- Algorithms - ESA 2003
- Algorithms for minimizing response time in broadcast scheduling
- Computing and Combinatorics
- NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
- On-line scheduling of jobs with fixed start and end times
- Scheduling broadcasts with deadlines
Cited in
(12)- Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs
- Computing and Combinatorics
- Scheduling broadcasts with deadlines
- A note on on-line broadcast scheduling with deadlines
- Improved On-Line Broadcast Scheduling with Deadlines
- Online scheduling with preemption or non-completion penalties
- ON-DEMAND BOUNDED BROADCAST SCHEDULING WITH TIGHT DEADLINES
- Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs
- Improved randomized online scheduling of intervals and jobs
- A near optimal scheduler for on-demand data broadcasts
- Algorithms - ESA 2003
- Theoretical Computer Science
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 Q835602)