Probabilistic analysis of a bin covering algorithm

Operations Research Letters

Volumn 18, Issue 4, 1996, Pages 193-199

  Han, Sunan ^a   Hong, Dawei ^a   Leung, Joseph Y T ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

Average case analysis; Bin covering; Bin packing; Heuristic; Np hard

Indexed keywords

EID: 0004465314     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6377(95)00053-4     Document Type: Article

References (8)

1. S.F. Assmann, D.S. Johnson, D.J. Kleitman and J.Y-T. Leung, "On a dual version of the one-dimensional bin packing problem", J. Algorithms 5, 502-525 (1984).
2. E.G. Coffman Jr., M.R. Garey and D.S. Johnson, "Approximation algorithms for bin packing - an updated survey", in: G. Ausiello, M. Lucertini and P. Serafini (eds.), Algorithm Design for Computer System Design, Springer, Berlin, 1984, pp. 49-106.
3. J. Csirik, J.B.G. Frenk, G. Galambos and A.H.G. Rinnooy Kan, "Probabilistic analysis of algorithms for dual bin packing problems", J. Algorithms 12, 189-203 (1991).
4. S. Han, D. Hong and J.Y-T. Leung, "Random processes for bin covering and bin packing", Tech. Report, UNL-CSE-92-13, Department of Computer Science and Engineering, University of Nebraska - Lincoln, Lincoln, NE 68588-0115, 1992.
5. J.F.C. Kingman, "Subadditive processes", Lecture Notes in Mathematics, Vol. 539, Springer, Berlin, 1976, pp. 167-223.
6. K.L. Krause, Y.Y. Shen and H.D. Schwetman, "Analysis of several task scheduling algorithms for a model of multi-programming computer systems", J. ACM 22, 522-550 (1975).
7. W.T. Rhee, "A note on optimal bin packing and optimal bin covering with items of random size", SIAM J. Comput. 19, 705-710 (1990).
8. W.T. Rhee and M. Talagrand, "Optimal bin covering with items of random size", SIAM J. Comput. 18, 487-498 (1989).