Worst-case analysis of the FFH algorithm for online variable-sized bin packing

Computing (Vienna/New York)

Volumn 56, Issue 2, 1996, Pages 165-172

  Zhang, G ^a,b  

^a Academia Sinica ^*

^b INSTITUTE OF APPLIED MATHEMATICS   (China)

Author keywords

Bin packing; Combinatorial problems; Online algorithm; Worst case analysis

Indexed keywords

ONLINE SYSTEMS; PROBLEM SOLVING;

COMBINATORIAL PROBLEMS; ONLINE ALGORITHMS; ONLINE VARIABLE SIZED BIN PACKING; WORST CASE ANALYSIS;

ALGORITHMS;

EID: 0029751899     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02309343     Document Type: Article

References (5)

1. Friesen, D. K., Langston, M. A.: Variable sized bin packing. SIAM J. Comput. 75, 222-229 (1986).
2. Garey, M. R., Graham, R. L. Johnson, D. S.: Resource constrained scheduling as generalized bin packing. J. Comb. Theory 21, 257-298 (1976).
3. Johnson, D. S.: Near-optimal bin packing algorithms. Doctoral Thesis MIT, Cambridge, MA (1973).
4. 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, 299-325 (1974).
5. Kinnersley, N. G., Langston, M. A.: Online variable-sized binpacking. Discrete Appl. Math. 22, 143-148 (1988/89).