Variants of classical one-dimensional bin packing

Handbook of Approximation Algorithms and Metaheuristics

Volumn , Issue , 2007, Pages 33-1-33-14

  Coffman, Edward G ^a   Csirik, János ^b   Leung, Joseph Y T ^c  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b UNIVERSITY OF SZEGED   (Hungary)

^c NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84937675766     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/9781420010749     Document Type: Chapter

References (26)

1. Coffman, E. G., Jr., Leung, J. Y.-T., and Ting, D. W., Bin packing: maximizing the number of pieces packed, Acta Informatica, 9, 263, 1978.
2. Boyar, J., Larsen, K. S., and Nielsen, M. N., The accommodation function: a generalization of the competitive ratio, SIAM J. Comput., 31, 233, 2001.
3. Krause, K. L., Shen, Y. Y., and Schwetman, H. D., Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems, JACM, 22, 522, 1975.
4. Coffman, Jr., E. G., Garey, M. R., and Johnson, D. S., Dynamic bin packing, SIAM J. Comput., 12, 227, 1983.
5. Liu, W.-P. and Sidney, J. B., Bin packing using semi-ordinal data, Oper. Res. Lett., 19, 101, 1996.
6. Mandal, C. A., Chakrabarti, P. P., and Ghose, S., Complexity of fragmentable object bin packing and an application, CANDM: Int. J.: Comput. Math. Appl., 35, 91, 1998.
7. Jansen, K. and Öhring, S., Approximation algorithms for time constrained scheduling, Inf. Control, 132, 85, 1997.
8. Azar, Y. and Regev, O., On-line bin-stretching, Theor. Comput. Sci., 268, 17, 2001.
9. Friesen, D. K. and Langston, M. A., Variable sized bin packing, SIAM J. Comput., 15, 222, 1986.
10. Assman, S. F., Johnson, D. S., Kleitman, D. J., and Leung, J. Y.-T., On a dual version of the onedimensional bin packing problem, J. Algorithms, 5, 502, 1984.
11. Coffman, E. G., Jr., and Leung, J. Y.-T., Combinatorial analysis of an efficient algorithm for processor and storage allocation, SIAM J. Comput., 8, 202, 1979.
12. Azar, Y., Boyar, J., Favrholdt, L. M., Larsen, K. S., Nielsen, M. N., and Epstein, L., Fair versus unrestricted bin packing, Algorithmica, 34, 181, 2002.
13. Boyar, J., Favrholdt, L. M., Larsen, K. S., and Nielsen, M. N., The competitive ratio for on-line dual bin packing with restricted input sequences, Nordic J. Comput., 8, 463, 2001.
14. Coffman, E. G., Jr., Garey, M. R., and Johnson, D. S., Bin packing with divisible item sizes, J. Complexity, 3, 405, 1987.
15. Anily, S., Bramel, J., and Simchi-Levi, D., Worst-case analysis of heuristics for the bin packing problem with general cost structures, Oper. Res., 42, 287, 1994.
16. Babel, L., Chen, B., Kellerer, H., and Kotov, V., On-line algorithms for cardinality constrained bin packing problems, in Proc. of ISAAC, Eades, P. and Takaoka, T., Eds., Lecture Notes in Computer Science, Vol. 2223, Springer, Berlin, 2001, p. 695.
17. Shachnai, H. and Tamir, T., Tight bounds for online class-constrained packing, in Proc. of LATIN, Rajsbaum, S., Ed., Lecture Notes in Computer Science, Vol. 2286, Springer, Berlin, 2002, p. 569.
18. Krumke, S. O., de Paepe, W., Rambau, J., and Stougie, L., Online bin-coloring, in Proc. of ESA, Meyer auf der Heide, F., Ed., Lecture Notes in Computer Science, Vol. 2161, Springer, Berlin, 2001, p. 74.
19. Menakerman, N. and Rom, R., Bin packing with item fragmentation, in Proc. of WADS, Dehne, F., Sack, J.-R., and Tamassia, R., Eds., Lecture Notes in Computer Science, Vol. 2125, Springer, Berlin, 2001, p. 313.
20. Katona, Gy. Y., Edge disjoint polyp packing, Discrete Appl. Math., 78, 133, 1997.
21. Codenetti, B., De Marco, G., Leoncini, M., Montangero, M., and Santini, M., Approximation algorithms for a hierarchically structured bin packing problem, Inf. Process. Lett., 89, 215, 2004.
22. Kellerer, H., Kotov, V., Speranza, M. G., and Tuza, Zs., Semi on-line algorithms for the partition problem, Oper. Res. Lett., 21, 235, 1997.
23. Epstein, L., Bin stretching revisited, Acta Informatica, 39, 97, 2003.
24. Speranza, M. G. and Tuza, Zs., On-line approximation algorithms for scheduling tasks on identical machines with extendable working time, Ann. Oper. Res., 86, 491, 1999.
25. Dell’Olmo, P., Kellerer, H., Speranza, M. G., and Tuza, Zs., A 13/12 approximation algorithm for bin packing with extendable bins, Inf. Process. Lett., 65, 229, 1998.
26. Yang, J. and Leung, J. Y.-T., The ordered open-end bin packing problem, Oper. Res., 51, 759, 2003.