Abstract
We investigate and analyze the FFH algorithm proposed by Kinnersley and Langston [5]. We prove that the tight worst-case performance bound of FFH algorithm is 1.7, thereby answering a question in [5]. The case that bin sizes can be chosen is also considered.
Zusammenfassung
Wir analysieren den von Kinnersley und Langston [5] vorgeschlagenen FFH-Algorithmus. Wir zeigen, daß der FFH Algorithmus eine scharfe Worst-Case Schranke von 1.7 hat und beantworten damit eine Frage in [5]. Variable Bingrößen werden ebenfalls betrachtet.
This is a preview of subscription content, log in via an institution to check access.
References
Friesen, D. K., Langston, M. A.: Variable sized bin packing. SIAM J. Comput.15, 222–229 (1986).
Garey, M. R., Graham, R. L., Johnson, D. S.: Resource constrained scheduling as generalized bin packing. J. Comb. Theory21, 257–298 (1976).
Johnson, D. S.: Near-optimal bin packing algorithms. Doctoral Thesis MIT, Cambridge, MA (1973).
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).
Kinnersley, N. G., Langston, M. A.: Online variable-sized binpacking. Discrete Appl. Math.22, 143–148 (1988/89).
Author information
Authors and Affiliations
Additional information
This work is supported by the National Natural Science Foundation of China, Project 19371084.
Rights and permissions
About this article
Cite this article
Zhang, G. Worst-Case analysis of the FFH algorithm for online variable-sized bin packing. Computing 56, 165–172 (1996). https://doi.org/10.1007/BF02309343
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02309343