Abstract
The relative worst-order ratio is a measure of the quality of online algorithms. In contrast to the competitive ratio, this measure compares two online algorithms directly instead of using an intermediate comparison with an optimal offline algorithm.
In this paper, we apply the relative worst-order ratio to online algorithms for several common variants of the bin packing problem. We mainly consider pairs of algorithms that are not distinguished by the competitive ratio and show that the relative worst-order ratio prefers the intuitively better algorithm of each pair.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Assman, S. F., Johnson, D. S., Kleitman, D. J., & Leung, J. Y.-T. (1984). On a dual version of the one-dimensional bin packing problem. Journal of Algorithms, 5(4), 502–525.
Ben-David, S., & Borodin, A. (1994). A new measure for the study of on-line algorithms. Algorithmica, 11(1), 73–91.
Boyar, J., Ehmsen, M. R., & Larsen, K. S. (2006). Theoretical evidence for the superiority of LRU-2 over LRU for the paging problem. In Approximation and online algorithms (pp. 95–107).
Boyar, J., & Favrholdt, L. M. (2007). The relative worst order ratio for online algorithms. ACM Transactions on Algorithms, 3(2), 22.
Boyar, J., Favrholdt, L. M., & Larsen, K. S. (2007). The relative worst order ratio applied to paging. Journal of Computer and System Sciences, 73(5), 818–843.
Boyar, J., & Medvedev, P. (2008). The relative worst order ratio applied to seat reservation. ACM Transactions on Algorithms, 4(4). Article 48, 22 pp.
Coffman, E. G., Jr., & Csirik, J. (2007). Performance guarantees for one-dimensional bin packing. In T. F. Gonzalez (Ed.), Handbook of approximation algorithms and metaheuristics. London: Chapman & Hall. Chap. 32, 18 pp.
Csirik, J., Frenk, J. B. G., Labbé, M., & Zhang, S. (1999). Two simple algorithms for bincovering. Acta Cybernetica, 14(1), 13–25.
Csirik, J., & Leung, J. Y.-T. (2007a). Variable-sized bin packing and bin covering. In T. F. Gonzalez (Ed.), Handbook of approximation algorithms and metaheuristics. London: Chapman & Hall. Chap. 34, 11 pp.
Csirik, J., & Leung, J. Y.-T. (2007b). Variants of classical one-dimensional bin packing. In T. F. Gonzalez (Ed.), Handbook of approximation algorithms and metaheuristics. London: Chapman & Hall. Chap. 33, 13 pp.
Csirik, J., & Totik, V. (1988). On-line algorithms for a dual version of bin packing. Discrete Applied Mathematics, 21, 163–167.
Ehmsen, M. R., Favrholdt, L. M., Kohrt, J. S., & Mihai, R. (2008). Comparing First-Fit and Next-Fit for online edge coloring. In 19th international symposium on algorithms and computation (pp. 89–99).
Epstein, L., Favrholdt, L. M., & Kohrt, J. S. (2006). Separating online scheduling algorithms with the relative worst order ratio. Journal of Combinatorial Optimization, 12(4), 362–385.
Graham, R. L. (1966). Bounds for certain multiprocessing anomalies. Bell Systems Technical Journal, 45, 1563–1581.
Hiller, B., & Vredeveld, T. (2008). Probabilistic analysis of online bin coloring algorithms via stochastic comparison. In Proceedings of the 16th annual European symposium (pp. 528–539).
Johnson, D. S. (1974). Fast algorithms for bin packing. Journal of Computer and System Sciences, 8(3), 272–314.
Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., & Graham, R. L. (1974). Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3(4), 299–325.
Karlin, A. R., Manasse, M. S., Rudolph, L., & Sleator, D. D. (1988). Competitive snoopy caching. Algorithmica, 3(1), 79–119.
Kenyon, C. (1996). Best-fit bin-packing with random order. In Proceedings of the 7th annual ACM-SIAM symposium on discrete algorithms (pp. 359–364).
Krumke, S. O., de Paepe, W. E., Rambau, J., & Stougie, L. (2008). Bincoloring. Theoretical Computer Science, 407(1–3), 231–241.
Lee, C. C., & Lee, D. T. (1985). A simple online bin packing algorithm. Journal of the ACM, 32(3), 562–572.
Shachnai, H., & Tamir, T. (2004). Tight bounds for online class-constrained packing. Theoretical Computer Science, 321, 103–123.
Xavier, E. C., & Miyazawa, F. K. (2008). The class constrained bin packing problem with applications to video-on-demand. Theoretical Computer Science, 393(1–3), 240–259.
Yang, J., & Leung, J. Y.-T. (2003). The ordered open-end bin packing problem. Operations Research, 51(5), 759–770.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Epstein, L., Favrholdt, L.M. & Kohrt, J.S. Comparing online algorithms for bin packing problems. J Sched 15, 13–21 (2012). https://doi.org/10.1007/s10951-009-0129-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-009-0129-5