Windows scheduling as a restricted version of bin packing

DOI10.1145/1273340.1273344zbMath1192.68941OpenAlexW2098128029MaRDI QIDQ3580939

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

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

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

Related Items (11)

Dynamic bin packing of unit fractions items ⋮ Scheduling policies for multi-period services ⋮ Dynamic bin packing with unit fraction items revisited ⋮ Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines ⋮ Dynamic Windows Scheduling with Reallocation ⋮ Windows scheduling of arbitrary-length jobs on multiple machines ⋮ Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case ⋮ Station assignment with reallocation ⋮ An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case ⋮ On dynamic bin packing: An improved lower bound and resource augmentation analysis ⋮ Periodic scheduling with obligatory vacations

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