no. 1
Bin-packing problems for a renewal process
Annales de l'I.H.P. Probabilités et statistiques, Tome 26 (1990) no. 1, pp. 207-217 
@article{AIHPB_1990__26_1_207_0,
     author = {Stadje, Wolfgang},
     title = {Bin-packing problems for a renewal process},
     journal = {Annales de l'I.H.P. Probabilit\'es et statistiques},
     pages = {207--217},
     year = {1990},
     publisher = {Gauthier-Villars},
     volume = {26},
     number = {1},
     mrnumber = {1075445},
     zbl = {0702.60076},
     language = {en},
     url = {https://www.numdam.org/item/AIHPB_1990__26_1_207_0/}
}
TY  - JOUR
AU  - Stadje, Wolfgang
TI  - Bin-packing problems for a renewal process
JO  - Annales de l'I.H.P. Probabilités et statistiques
PY  - 1990
SP  - 207
EP  - 217
VL  - 26
IS  - 1
PB  - Gauthier-Villars
UR  - https://www.numdam.org/item/AIHPB_1990__26_1_207_0/
LA  - en
ID  - AIHPB_1990__26_1_207_0
ER  - 
%0 Journal Article
%A Stadje, Wolfgang
%T Bin-packing problems for a renewal process
%J Annales de l'I.H.P. Probabilités et statistiques
%D 1990
%P 207-217
%V 26
%N 1
%I Gauthier-Villars
%U https://www.numdam.org/item/AIHPB_1990__26_1_207_0/
%G en
%F AIHPB_1990__26_1_207_0
Stadje, Wolfgang. Bin-packing problems for a renewal process. Annales de l'I.H.P. Probabilités et statistiques, Tome 26 (1990) no. 1, pp. 207-217. https://www.numdam.org/item/AIHPB_1990__26_1_207_0/

[1] S. Asmussen, Applied Probability and Queues, J. Wiley, New York, 1987. | Zbl | MR

[2] E.G. Coffman Ed., Computer and Job-Shop Scheduling Theory, Wiley, New York, 1976. | Zbl | MR

[3] E.G. Coffman, J.Y. Leung and D.W. Ting, Bin Packing: Maximizing the Number of Pieces Packed, Acta Inform., Vol. 9, 1978, pp. 263-271. | Zbl | MR

[4] E.G. Coffman, K. So, M. Hofri and A.C. Yao, A Stochastic Model of Bin-Packing, Inform. Control, Vol. 44, 1980, pp. 105-115. | Zbl | MR

[5] W. Feller, An Introduction to Probability Theory and Its Applications, Vol. II. 2nd edition, Wiley, New York, etc., 1971. | Zbl | MR

[6] D.S. Johnson. Fast Algorithms for Bin-Packing, J. Comput. Syst. Sci., Vol. 8, 1974, pp. 272-314. | Zbl | MR

[7] D.S. Johnson, A. Demers, J.D. Ullman, M.R. Garey and R.L. Graham. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms, Siam J. Comput., Vol. 3, 1974, pp. 299-326. | Zbl | MR

[8] G.M. Laslett, D.B. Pollard and R.L. Tweedie, Techniques for Establishing Ergodic and Recurrence Properties of Continuous-Valued Markov Chains, Naval. Res. Logist. Quart., Vol. 25, 1987, pp. 455-472. | Zbl | MR

[9] H.L. Ong, Probabilistic Analysis of Bin Packing Heuristics, Oper. Res., Vol. 32, 1986, pp. 983-998. | Zbl | MR

[10] A.N. Shiryayev, Probability, Springer, New York, etc., 1984. | Zbl | MR

[11] R.L. Tweedie, Sufficient Conditions for Ergodicity and Recurrence of Markov Cahins on a General State Space, Stoch. Proc. Appl., Vol. 3, 1975, pp. 385-403. | Zbl | MR