On a dual version of the one-dimensional bin packing problem

Journal of Algorithms

Volumn 5, Issue 4, 1984, Pages 502-525

  Assmann, S F ^a   Johnson, D S ^b   Kleitman, D J ^a   Leung, J Y T ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000062025     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/0196-6774(84)90004-X     Document Type: Article

References (18)

1. Problems in Discrete Applied Mathematics
2. A tight asymptotic bound for next-fit-decreasing bin-packing
3. Bin packing: Maximizing the number of pieces packed
4. A stochastic model of bin-packing
5. Scheduling to maximize the minimum processor finish time in a multiprocessor system
6. Bin packing can be solved within 1 + ϵ in linear time
7. Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
8. Resource constrained scheduling as generalized bin packing
9. Worst-case analysis of memory allocation algorithms
10. Bounds on multiprocessing timing anomalies
11. Near-optimal Bin Packing Algorithms
12. Fast algorithms for bin packing
13. Worst-case performance bounds for simple one-dimensional packing algorithms
14. Probabilistic analysis of some bin packing algorithms
15. An efficient approximation scheme for the one-dimensional bin packing problem
16. New algorithms for bin packing