Algorithms for the relaxed online bin-packing model

SIAM Journal on Computing

Volumn 30, Issue 5, 2000, Pages 1532-1551

  Gambosi, Giorgio ^a   Postiglione, Alberto ^b   Talamo, Maurizio ^c  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b UNIVERSITY OF SALERNO   (Italy)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Approximation algorithms; Bin packing; Complexity; Online algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MULTIPROCESSING SYSTEMS; MULTIPROGRAMMING; ONLINE SYSTEMS;

APPROXIMATION ALGORITHMS; LOWER BOUNDS; ONLINE ALGORITHMS; RELAXED ONLINE BIN PACKING PROBLEM;

OPTIMIZATION;

EID: 0035183669     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799180408     Document Type: Article

References (34)

1. A. V. AHO, J. E. HOPCROFT, AND J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. J. L. BENTLEY, D. S. JOHNSON, F. T. LEIGHTON, AND C. C. MCGEOCH, An experimental study of bin packing, in Proceedings of the 21st Annual Allerton Conference on Communication, Control, and Computing, University of Illinois, Urbana, IL, 1983, pp. 51-60.
3. J. L. BENTLEY, D. S. JOHNSON, F. T. LEIGHTON, C. C. MCGEOCH, AND L. A. MCGEOCH, Some unexpected expected behavior results for bin-packing, in Proceedings of the 16th ACM Symposium on the Theory of Computing, Washington, DC, 1984, pp. 279-288.
4. A. BORODIN, N. LINIAL, AND M. SAKS, An optimal online algorithm for metrical task systems, in Proceedings of the 19th ACM Symposium on the Theory of Computing, New York, 1987, pp. 373-382.
5. D. J. BROWN, An improved BL lower bound, Inform. Process Lett., 11 (1980), pp. 37-39.
6. D. J. BROWN AND P. RAMANAN, Online bin packing in linear time, in Proceedings of the 1984 Conference on Information Sciences and Systems, Princeton University, Princeton, NJ, 1984, pp. 328-332.
7. E. G. COFFMAN, JR., M. R. GAREY, AND D. S. JOHNSON, Approximation algorithms for bin-packing - An updated survey, in Algorithm Design for Computer System Design, G. Ausiello and M. Lucertini, eds., Springer-Verlag, New York, 1984, pp. 49-106.
8. E. G. COFFMAN, JR., M. R. GAREY, AND D. S. JOHNSON, Approximation algorithms for bin-packing: A survey, in Approximation Algorithms of NP-Hard Problems, D. S. Hochbaum ed., PWS Publishing Company, Boston, 1996, pp. 46-93.
9. E. G. COFFMAN, JR., M. HOFRI, K. SO, AND A. C. YAO, A stochastic model of bin packing, Informat. Control, 44 (1980), pp. 105-115.
10. J. CSIRIK AND D. S. JOHNSON, Bounded space online bin-packing: Best is better than First, in Proceedings of the Second ACM-SIAM Symposium on Discrete Algorithms, San Francisco,1991, pp. 309-319.
11. G. GAMBOSI, A. POSTIGLIONE, AND M. TALAMO, On the Online Bin-Packing Problem, IASI Technical Report R.263, Roma, 1989.
12. G. GAMBOSI, A. POSTIGLIONE, AND M. TALAMO, New algorithms for online bin-packing, in Algorithms and Complexity, G. Ausiello, D. Bovet, and R. Petreschi, eds., World Scientific Publishing, Roma, 1990, pp. 44-59.
13. G. GAMBOSI, A. POSTIGLIONE, AND M. TALAMO, Online maintenance of an approximate bin-packing solution, Nordic J. Comput., 4 (1997), pp. 151-166.
14. M. R. GAREY, R. L. GRAHAM, D. S. JOHNSON, AND A. C. YAO, Resource constrained scheduling as generalized bin-packing, J. Combin. Theory Ser. A, 21 (1976), pp. 257-298.
15. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, CA, 1979.
16. P. C. GILMORE AND R. E. GOMORY, A linear programming approach to the cutting stock problem, Oper. Res., 9 (1961), pp. 849-859.
17. P. C. GILMORE AND R. E. GOMORY, A linear programming approach to the cutting stock problem - Part II, Oper. Res., 11 (1963), pp. 863-888.
18. R. L. GRAHAM, Bounds for certain multiprocessing anomalies, Bell System Tech. J., 45 (1966), pp. 1563-1581.
19. R. L. GRAHAM, Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math., 17 (1969), pp. 416-429.
20. N. KARMARKAR AND R. M. KARP, An efficient approximation scheme for the one-dimensional bin-packing problem, in Proceedings of the 23th IEEE Symposium on Foundation of Computer Science, Chicago, 1982, pp. 312-320.
21. R. M. KARP, Reducibility among combinatorial problems, in Complexity of Computer Computations, R. E. Miller and J. M. Thatcher, eds., Plenum Press, New York, 1972, pp. 85-105.
22. B. KORTE AND D. HAUSMANN, Matroids and independence systems, in Modern Applied Mathematics: Optimization and Operations Research, B. Korte, ed., North-Holland, Amsterdam, 1982, pp. 517-553.
23. D. S. JOHNSON, Fast algorithms for bin-packing, J. Comput. System Sci., 8 (1974), pp. 272-314.
24. D. S. JOHNSON, A. DEMERS, J. D. ULLMAN, M. R. GAREY, AND R. L. GRAHAM, Worst-case performance bounds for simple one-dimensional packing algorithms, SIAM J. Comput., 3 (1974), pp. 299-325.
25. C. C. LEE AND D. T. LEE, A simple online bin-packing algorithm, J. ACM, 3 (1985), pp. 562-572.
26. F. M. LIANG, A lower bound for on-line bin packing, Inform. Process. Lett., 10 (1980), pp. 76-79.
27. R. LOULOU, Probabilistic behavior of optimal bin-packing solutions, Oper. Res. Lett., 3 (1984), pp. 129-135.
28. M. S. MANASSE, L. A. MCGEOCH, AND D. D. SLEATOR, Competitive algorithms for server problems, J. Algorithms, 11 (1990), pp. 208-230.
29. P. RAMANAN AND K. TSUGA, K., Average-case of the modified harmonic algorithm, Algorithmica, 4 (1989), pp. 519-533.
30. P. RAMANAN, Average-case analysis of the SMART-NEXT-FIT algorithm, Inform. Process. Lett., 31 (1989), pp. 221-225.
31. P. RAMANAN, D. J. BROWN, C. C. LEE, AND D. T. LEE, On-line bin-packing in linear time, J. Algorithms, 10 (1989), pp. 305-326.
32. P. W. SHOR, The average-case of some on-line algorithms for bin-packing, Combinatorica, 6 (1986), pp. 179-200.
33. R. E. TARJAN, Data Structures and Network Algorithms, CMBS-NSF Regional Conf. Ser. in Appl. Math. 44, SIAM, Philadelphia, 1983.
34. A. C. YAO, New algorithms for bin-packing, J. ACM, 27 (1980), pp. 207-227.