On Optimal Packing of Randomly Arriving Objects

DOI10.1287/MOOR.16.1.176MaRDI QIDQ3363091zbMATH OpenOpenAlexFDO

Authors Uriel G. Rothblum, Costas Courcoubetis

Publication date 1991

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.16.1.176

zbMATH Keywords

\(\epsilon\)-optimal policiesadaptive controlcontrolled queueingindependent stationary Poisson processeslong run average expected rewardoptimal bin packingquasi-stable policies

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35) Markov and semi-Markov decision processes (90C40)

Recommendations

• Necessary and sufficient conditions for stability of a bin-packing system
• Stability of On-Line Bin Packing with Random Arrivals and Long-Run-Average Constraints
• The stochastic knapsack problem
• Optimal Bin Packing with Items of Random Sizes
• Publication:3470374

Cited in

(4)

• Packing items from a triangular distribution
• Optimal choice and assignment of the best \(m\) of \(n\) randomly arriving items
• scientific article; zbMATH DE number 3920196 (Why is no real title available?)
• Necessary and sufficient conditions for stability of a bin-packing system

This page was built for publication: On Optimal Packing of Randomly Arriving Objects

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