Bin packing with divisible item sizes
- 1 December 1987
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 3 (4) , 406-428
- https://doi.org/10.1016/0885-064x(87)90009-4
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Variable Sized Bin PackingSIAM Journal on Computing, 1986
- Scheduling File TransfersSIAM Journal on Computing, 1985
- On a dual version of the one-dimensional bin packing problemJournal of Algorithms, 1984
- Dynamic Bin PackingSIAM Journal on Computing, 1983
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor SystemSIAM Journal on Algebraic Discrete Methods, 1982
- On Packing Two-Dimensional BinsSIAM Journal on Algebraic Discrete Methods, 1982
- Performance Bounds for Level-Oriented Two-Dimensional Packing AlgorithmsSIAM Journal on Computing, 1980
- Combinatorial Analysis of an Efficient Algorithm for Processor and Storage AllocationSIAM Journal on Computing, 1979
- Bin packing: Maximizing the number of pieces packedActa Informatica, 1978
- Resource constrained scheduling as generalized bin packingJournal of Combinatorial Theory, Series A, 1976