Bin Packing with Queues

DOI10.1239/JAP/1231340224MaRDI QIDQ5504150zbMATH OpenOpenAlexFDO

Authors 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

bin packingheavy trafficqueueing

Mathematics Subject Classification ID

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

Recommendations

• Online bandwidth packing with symmetric distribution
• Necessary and sufficient conditions for stability of a bin-packing system
• Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings
• Optimal Bin Packing with Items of Random Sizes
• Optimal Bin Packing with Items of Random Sizes II

Cites work

• A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random Size
• Bandwidth packing
• scientific article; zbMATH DE number 6118219 (Why is no real title available?)
• scientific article; zbMATH DE number 3722129 (Why is no real title available?)
• scientific article; zbMATH DE number 47258 (Why is no real title available?)
• scientific article; zbMATH DE number 1158743 (Why is no real title available?)
• scientific article; zbMATH DE number 1522943 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• On optimal matchings
• Optimal Bin Packing of Items of Sizes Uniformly Distributed over [0, 1]
• Optimal Bin Packing with Items of Random Sizes
• Optimal Bin Packing with Items of Random Sizes II
• Optimal Bin Packing with Items of Random Sizes III
• Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
• Stochastic and dynamic vehicle routing with general demand and interarrival time distributions
• Stochastic bandwidth packing process: stability conditions via Lyapunov function technique
• 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

Cited in

(7)

• More on batched bin packing
• Online bandwidth packing with symmetric distribution
• Necessary and sufficient conditions for stability of a bin-packing system
• Optimal scaling of average queue sizes in an input-queued switch: an open problem
• Asymptotic properties of stochastic greedy bin-packing
• Fast approximation methods for online scheduling of outpatient procedure centers
• Interior-point-based online stochastic bin packing

This page was built for publication: Bin Packing with Queues

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