Windows scheduling as a restricted version of bin packing

DOI10.1145/1273340.1273344MaRDI QIDQ3580939zbMATH OpenOpenAlexFDO

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

Publication date 14 August 2010

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1273340.1273344

Mathematics Subject Classification ID

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

Cited in

(16)

• On dynamic bin packing: An improved lower bound and resource augmentation analysis
• Periodic scheduling with obligatory vacations
• Dynamic bin packing with unit fraction items revisited
• Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
• Dynamic bin packing of unit fractions items
• Windows scheduling of arbitrary-length jobs on multiple machines
• Scheduling policies for multi-period services
• Dynamic windows scheduling with reallocation
• Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines
• Minimizing the size of the uncertainty regions for centers of moving entities
• Station assignment with reallocation
• Contention resolution with message deadlines
• Perpetual scheduling with explorable uncertainty
• Hardness and fixed parameter tractability for pinwheel scheduling problems
• Hardness and fixed parameter tractability for pinwheel scheduling problems

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 Q3580939)