Windows scheduling as a restricted version of bin packing

zbMATH Open1317.68290MaRDI QIDQ5501263FDOQ5501263

Authors Amotz Bar-Noy, Richard E. Ladner, Tami Tamir

Publication date 3 August 2015

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 2119694
• Windows Scheduling Problems for Broadcast Systems
• Windows scheduling of arbitrary-length jobs on multiple machines
• Algorithms and Computation
• Dynamic windows scheduling with reallocation

Cited in

(9)

• Dynamic windows scheduling with reallocation
• Algorithms and Computation
• Experimental and Efficient Algorithms
• scientific article; zbMATH DE number 2119694 (Why is no real title available?)
• The maximum resource bin packing problem
• Windows Scheduling Problems for Broadcast Systems
• Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems
• Optimal scheduling and control for constrained multi‐agent networked control systems
• Windows scheduling of arbitrary-length jobs on multiple machines

This page was built for publication: Windows scheduling as a restricted version of bin packing

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