Tight bounds for online class-constrained packing

Theoretical Computer Science

Volumn 321, Issue 1, 2004, Pages 103-123

  Shachnai, Hadas ^a   Tamir, Tami ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b University of Washington   (United States)

Author keywords

Bin packing; Class constraints; Multiple knapsack; Online algorithms; Temporary assignment

Indexed keywords

ALGORITHMS; MANUFACTURING DATA PROCESSING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; RESOURCE ALLOCATION;

BIN PACKING; CLASS-CONSTRAINTS; MULTIPLE KNAPSACK; ONLINE ALGORITHMS; TEMPORARY ASSIGNMENT;

ONLINE SYSTEMS;

EID: 2442516026     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.05.006     Document Type: Conference Paper

References (26)

1. A. Armon, Y. Azar, L. Epstein, O. Regev, Temporary tasks assignment resolved, in: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2002, pp. 116-124.
2. Azar Y., Boyar J., Favrholdt L.M., Larsen K.S., Nielsen M.N., Epstein L. Fair versus unrestricted bin packing. Algorithmica. 34(2):2002;181-196.
3. Azar Y., Broder A., Karlin A. On-line load balancing. Theoret. Comput. Sci. 130:1994;73-84.
4. Y. Azar, L. Epstein, On-line load balancing of temporary tasks on identical machines, in: Proc. 5th ISTCS, 1997, pp. 119-125.
5. L. Babel, B.Chen, H. Kellerer, V. Kotov, On-line algorithms for cardinality constraint bin packing problems, Tech. Report, Institut fuer Statistik und Operations Research, Universitaet Graz, 2001.
6. Borodin A., El-Yaniv R. Online Computation and Competitive Analysis. 1998;Cambridge University Press, Cambridge.
7. Boyar J., Larsen K.S., Nielsen M.N. The accommodating function. a generalization of the competitive ratio SIAM J. Comput. 31(1):2001;233-258.
8. Caprara A., Kellerer H., Pferschy U., Pisinger D. Approximation algorithms for knapsack problems with cardinality constraints. European J. Oper. Res. 123:2000;333-345.
9. W.J. Davis, D.L. Setterdahl, J.G. Macro, V. Izokaitis, B. Bauman, Recent advances in the modeling, scheduling and control of flexible automation, in: Proc. Winter Simulation Conf., 1993, pp. 143-155.
10. Fiat A., Woeginger G.J. Online Algorithms: The State of the Art. Lecture Notes in Computer Science. Vol. 1442:1998;Springer, Berlin.
11. M.R. Garey, R.L. Graham, J.D. Ullman, Worst-case analysis of memory allocation algorithms, in: Proc. 4th ACM Symp. on Theory of Computing, 1972.
12. Ghandeharizadeh S., Muntz R.R. Design and implementation of scalable continuous media servers. Parallel Comput. J. 24(1):1998;91-122.
13. L. Golubchik, S. Khanna, S. Khuller, R. Thurimella, A. Zhu, Approximation algorithms for data placement on parallel disks, in: Proc. 11th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2000, pp. 223-232.
14. Hochbaum D.S. Approximation Algorithms for NP-Hard Problems. 1995;PUS Publishing Company, Boston, MA.
15. D.S. Johnson, Near-optimal bin packing algorithms, Ph.D. Thesis, MIT, Cambridge, MA, 1973.
16. Johnson D.S. Fast algorithms for bin packing. J. Comput. System Sci. 8:1974;272-314.
17. Johnson D.S., Demers A., Ullman J.D., Garey M.R., Graham R.L. Worst-case performance bounds for simple one-dimensional packing algorithm. SIAM J. Comput. 3:1974;256-278.
18. Kellerer H., Pferschy U. Cardinality constrained bin-packing problems. Ann. Oper. Res. 92:1999;335-349.
19. S.O. Krumke, W. de Paepe, J. Rambau, L. Stougie, Online bin-coloring, in: Proc. 9th Annu. European Symp. on Algorithms (ESA), 2001, pp. 74-85.
20. Martello S., Toth P. Algorithms for knapsack problems. Ann. Discrete Math. 31:1987;213-258.
21. Shachnai H., Tamir T. Polynomial time approximation schemes for class-constrained packing problems. J. Schedul. 4:2001;313-338.
22. Shachnai H., Tamir T. On two class-constrained versions of the multiple knapsack problem. Algorithmica. 29:2001;442-467.
23. Shachnai H., Tamir T. Multiprocessor scheduling with machine allotment and parallelism constraints. Algorithmica. 32(4):2002;651-678.
24. van Vliet A. On the asymptotic worst case behavior of harmonic fit. J. Algorithms. 20:1996;113-136.
25. Wolf J.L., Yu P.S., Shachnai H. Disk load balancing for video-on-demand systems. ACM Multimedia Systems J. 5:1997;358-370.
26. Yao A. New algorithms for bin packing. J. ACM. 27:1980;207-227.