Bin Packing with Queues

DOI10.1239/jap/1231340224zbMath1152.90477OpenAlexW2168980528MaRDI QIDQ5504150

Devavrat Shah, John N. Tsitsiklis

Publication date: 21 January 2009

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/jap/1231340224

zbMATH Keywords

queueingheavy trafficbin packing

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)

Related Items (3)

Optimal scaling of average queue sizes in an input-queued switch: an open problem ⋮ Fast Approximation Methods for Online Scheduling of Outpatient Procedure Centers ⋮ Interior-Point-Based Online Stochastic Bin Packing

Cites Work

• On optimal matchings
• The average-case analysis of some on-line algorithms for bin packing
• Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
• Stochastic bandwidth packing process: stability conditions via Lyapunov function technique
• Bandwidth packing
• Optimal Bin Packing of Items of Sizes Uniformly Distributed over [0, 1]
• A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random Size
• Optimal Bin Packing with Items of Random Sizes III
• Optimal Bin Packing with Items of Random Sizes
• Optimal Bin Packing with Items of Random Sizes II
• Stochastic and dynamic vehicle routing with general demand and interarrival time distributions
• Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bin Packing with Queues