Windows scheduling as a restricted version of bin packing
DOI10.1145/1273340.1273344zbMATH Open1192.68941OpenAlexW2098128029MaRDI QIDQ3580939FDOQ3580939
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
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)
Cited In (12)
- 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 windows scheduling with reallocation
- On dynamic bin packing: An improved lower bound and resource augmentation analysis
- Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines
- Scheduling policies for multi-period services
- Periodic scheduling with obligatory vacations
- Dynamic bin packing with unit fraction items revisited
- Dynamic bin packing of unit fractions items
- Station assignment with reallocation
- Minimizing the size of the uncertainty regions for centers of moving entities
- 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 Q3580939)
