Variants of Classical One-Dimensional Bin Packing

Joseph Y.-T. Leung New Jersey Institute of Technology 33.

[1]  Joseph Y.-T. Leung,et al.  Combinatorial analysis of an efficient algorithm for processor and storage allocation , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[2]  Jeffrey B. Sidney,et al.  Bin packing using semi-ordinal data , 1996, Oper. Res. Lett..

[3]  Joan Boyar,et al.  The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences , 2001, Nord. J. Comput..

[4]  Raphael Rom,et al.  Bin Packing with Item Fragmentation , 2001, WADS.

[5]  Klaus Jansen,et al.  Approximation Algorithms for Time Constrained Scheduling , 1995, IRREGULAR.

[6]  Herb Schwetman,et al.  Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems , 1975, JACM.

[7]  Hadas Shachnai,et al.  Tight Bounds for Online Class-Constrained Packing , 2002, LATIN.

[8]  C. Mandal,et al.  Complexity of fragmentable object bin packing and an application , 1998 .

[9]  Yossi Azar,et al.  On-Line Bin-Stretching , 1998, RANDOM.

[10]  D. K. Friesen,et al.  Variable Sized Bin Packing , 1986, SIAM J. Comput..

[11]  David Simchi-Levi,et al.  Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures , 1994, Oper. Res..

[12]  Edward G. Coffman,et al.  Bin packing with divisible item sizes , 1987, J. Complex..

[13]  Joan Boyar,et al.  The Accommodating Function: A Generalization of the Competitive Ratio , 2001, SIAM J. Comput..

[14]  Joseph Y.-T. Leung,et al.  On a Dual Version of the One-Dimensional Bin Packing Problem , 1984, J. Algorithms.

[15]  Edward G. Coffman,et al.  Dynamic Bin Packing , 1983, SIAM J. Comput..

[16]  Joseph Y.-T. Leung,et al.  Bin packing: Maximizing the number of pieces packed , 2004, Acta Informatica.

[17]  T Takaoka,et al.  On-line algorithms for cardinality constrained bin packing problems , 2001 .