Bin-packing problems for a renewal process

MaRDI QIDQ915276zbMATH OpenFDO

Authors Wolfgang Stadje

Publication date 1990

Published in Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=AIHPB_1990__26_1_207_0, https://eudml.org/doc/77373

zbMATH Keywords

bin packingMarkov chain with continuous state spacerenewal process

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Renewal theory (60K05)

Recommendations

• Some inequalities for bin packing
• On Line Bin Packing with Items of Random Size
• Next-fit bin packing with random piece sizes
• Bin packing as a random walk: A note on Knödel's paper
• Optimal Bin Packing with Items of Random Sizes III

Cited in

(1)

• The problems of servicing of the binary object flow in system with refillable storage component

This page was built for publication: Bin-packing problems for a renewal process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915276)