Algorithms for on-line bin-packing problems with cardinality constraints

Discrete Applied Mathematics

Volumn 143, Issue 1-3, 2004, Pages 238-251

  Babel, Luitpold ^a   Chen, Bo ^b   Kellerer, Hans ^c   Kotov, Vladimir ^d  

^a AIRBUS GROUP INNOVATIONS   (Germany)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c UNIVERSITY OF GRAZ   (Austria)

^d BELARUSIAN STATE UNIVERSITY   (Belarus)

Author keywords

Bin packing; Cardinality constraint; On line algorithms

Indexed keywords

ALGORITHMS; BOUNDARY VALUE PROBLEMS; CONSTRAINT THEORY; DATA STORAGE EQUIPMENT; FINITE DIFFERENCE METHOD; HEURISTIC METHODS; PACKING; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; VECTORS;

BIN-PACKING; CARDINALITY CONSTRAINTS; COMPUTER MEMORY; STORAGE ALLOCATION;

ONLINE SYSTEMS;

EID: 4243167841     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.05.006     Document Type: Article

References (12)

1. Caprara A., Kellerer H., Pferschy U. Approximation schemes for ordered vector packing problems. Naval Res. Logist. 50:2002;58-69.
2. Coffman E.G., Csirik J., Woeginger G. Approximate solutions of bin packing problems. Pardalos P.M., Resende M.G.C. Handbook of Applied Optimization. 2002;Oxford University Press, Oxford.
3. Csirik J., Woeginger G. On-line packing and covering problems. Fiat A., Woeginger G. Online Algorithms: The State of the Art. Lecture Notes in Computer Science. Vol. 1442:1998;147-177 Springer, Berlin.
4. Garey M.R., Graham R.L., Johnson D.S., Yao A.C.C. Resource constrained scheduling as generalized bin packing. J. Combin. Theory A. 21:1976;257-298.
5. Johnson D.S., Demers A., Ullman J.D., Garey M.R., Graham R.L. Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM J. Comput. 3:1974;299-325.
6. Krause K.L., Shen V.Y., Schwetman H.D. Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems. J. ACM. 22:1975;522-550.
7. Krause K.L., Shen V.Y., Schwetman H.D. Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems (Errata). J. ACM. 24:1977;527.
8. Lee C.C., Lee D.T. A simple on-line bin packing algorithm. J. ACM. 32:1985;562-572.
9. Richey M.B. Improved bounds for harmonic-based bin packing algorithms. Discrete Appl. Math. 34:1991;203-227.
10. S. Seiden, On the online bin packing problem, Proceedings of the 28th International Colloquium on Automata, Languages and Programming, 2001, pp. 237-248.
11. van Vliet A. An improved lower bound for on-line bin packing algorithms. Inform. Process. Lett. 43:1992;277-284.
12. Yao A.C.C. New algorithms for bin packing. J. ACM. 27:1980;207-227.