Windows Scheduling Problems for Broadcast Systems
From MaRDI portal
Recommendations
Cited in
(28)- Scheduling techniques for media-on-demand
- Periodic scheduling with obligatory vacations
- Generating asymptotically optimal broadcasting schedules to minimize average waiting time
- The weighted fair sequences problem
- Dynamic bin packing with unit fraction items revisited
- A branch-and-price algorithm for the aperiodic multi-period service scheduling problem
- Dynamic bin packing of unit fractions items
- Windows scheduling of arbitrary-length jobs on multiple machines
- An iterative exact algorithm for the weighted fair sequences problem
- Scheduling policies for multi-period services
- scientific article; zbMATH DE number 2119694 (Why is no real title available?)
- Dynamic windows scheduling with reallocation
- A general buffer scheme for the windows scheduling problem
- Energy-Efficient Windows Scheduling
- Windows scheduling as a restricted version of bin packing
- Experimental and Efficient Algorithms
- Algorithms and Computation
- Optimal scheduling and control for constrained multi‐agent networked control systems
- An efficient implementation of a VNS heuristic for the weighted fair sequences problem
- Minimizing the size of the uncertainty regions for centers of moving entities
- Station assignment with reallocation
- On the periodic service scheduling problem with non-uniform demands
- Contention resolution with message deadlines
- Perpetual scheduling with explorable uncertainty
- Pinwheel covering
- Hardness and fixed parameter tractability for pinwheel scheduling problems
- Hardness and fixed parameter tractability for pinwheel scheduling problems
- Optimal delay for media-on-demand with pre-loading and pre-buffering
This page was built for publication: Windows Scheduling Problems for Broadcast Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4429676)
