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

This publication has 11 references indexed in Scilit:

• Fast algorithms for bin packing
  Published by Elsevier ,2007
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
  SIAM Journal on Algebraic Discrete Methods, 1982
• Bin packing can be solved within 1 + ε in linear time
  Combinatorica, 1981
• A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing
  SIAM Journal on Algebraic Discrete Methods, 1981
• Probabilistic analysis for simple one-and two-dimensional bin packing algorithms
  Information Processing Letters, 1980
• A stochastic model of bin-packing
  Information and Control, 1980
• Bin packing: Maximizing the number of pieces packed
  Acta Informatica, 1978
• Resource constrained scheduling as generalized bin packing
  Journal of Combinatorial Theory, Series A, 1976
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
  SIAM Journal on Computing, 1974
• Bounds on Multiprocessing Timing Anomalies
  SIAM Journal on Applied Mathematics, 1969