@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}, volume = {26}, year = {1990}, pages = {207-217}, mrnumber = {1075445}, zbl = {0702.60076}, language = {en}, url = {http://dml.mathdoc.fr/item/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) pp. 207-217. http://gdmltest.u-ga.fr/item/AIHPB_1990__26_1_207_0/
[1] Applied Probability and Queues, J. Wiley, New York, 1987. | MR 889893 | Zbl 0624.60098
,[2] Computer and Job-Shop Scheduling Theory, Wiley, New York, 1976. | MR 629691 | Zbl 0359.90031
Ed.,[3] Bin Packing: Maximizing the Number of Pieces Packed, Acta Inform., Vol. 9, 1978, pp. 263-271. | MR 493579 | Zbl 0421.68065
, and ,[4] A Stochastic Model of Bin-Packing, Inform. Control, Vol. 44, 1980, pp. 105-115. | MR 567005 | Zbl 0447.68078
, , and ,[5] An Introduction to Probability Theory and Its Applications, Vol. II. 2nd edition, Wiley, New York, etc., 1971. | MR 270403 | Zbl 0219.60003
,[6] Fast Algorithms for Bin-Packing, J. Comput. Syst. Sci., Vol. 8, 1974, pp. 272-314. | MR 373370 | Zbl 0284.68023
.[7] Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms, Siam J. Comput., Vol. 3, 1974, pp. 299-326. | MR 434396 | Zbl 0297.68028
, , , and .[8] Techniques for Establishing Ergodic and Recurrence Properties of Continuous-Valued Markov Chains, Naval. Res. Logist. Quart., Vol. 25, 1987, pp. 455-472. | MR 518068 | Zbl 0393.60064
, and ,[9] Probabilistic Analysis of Bin Packing Heuristics, Oper. Res., Vol. 32, 1986, pp. 983-998. | MR 770505 | Zbl 0551.90067
,[10] Probability, Springer, New York, etc., 1984. | MR 737192 | Zbl 0536.60001
,[11] Sufficient Conditions for Ergodicity and Recurrence of Markov Cahins on a General State Space, Stoch. Proc. Appl., Vol. 3, 1975, pp. 385-403. | MR 436324 | Zbl 0315.60035
,