Bin packing with divisible item sizes
From MaRDI portal
Publication:1100914
DOI10.1016/0885-064X(87)90009-4zbMath0641.68097OpenAlexW1984027871MaRDI QIDQ1100914
D. S. Johson, Michael R. Garey, Edward G. jun. Coffman
Publication date: 1987
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0885-064x(87)90009-4
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Combinatorial aspects of packing and covering (05B40) Discrete mathematics in relation to computer science (68R99)
Related Items
Divisors of codes of Reed-Muller type, Optimal packet-to-slot assignment in mobile telecommunications, Bin packing with divisible item sizes and rejection penalties, Dynamic bin packing of unit fractions items, Optimal energy-efficient placement of virtual machines with divisible sizes, Homogeneous grouping of non-prime steel products for online auctions: a case study, Scheduling tree-structured tasks with restricted execution times, ATM VP-based network design, Dynamic bin packing with unit fraction items revisited, Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems, Motion planning with pulley, rope, and baskets, Exact algorithms for solving the constrained parallel-machine scheduling problems with divisible processing times and penalties, Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines, Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties, Approximation algorithms for a virtual machine allocation problem with finite types, Scheduling multiprocessor tasks on parallel processors with limited availability., Scheduling games with rank-based utilities, Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case, Scheduling multiprocessor tasks for mean flow time criterion, A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem, Relaxations and exact solution of the variable sized bin packing problem, 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, Heuristics for the variable sized bin-packing problem, The complexity of multidimensional periodic scheduling, Bin packing with restricted piece sizes, EFFICIENT PARALLEL JOB SCHEDULING USING GANG SERVICE, Scheduling space-sharing for internet advertising, Algorithms for the variable sized bin packing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Bin packing: Maximizing the number of pieces packed
- Resource constrained scheduling as generalized bin packing
- Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation
- A class of dynamic memory allocation algorithms
- On a dual version of the one-dimensional bin packing problem
- Dynamic Bin Packing
- Variable Sized Bin Packing
- Scheduling File Transfers
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- On Packing Two-Dimensional Bins
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Bounds on Multiprocessing Timing Anomalies
