On the Optimality of the Probability Ranking Scheme in Storage Applications
From MaRDI portal
Publication:4403715
DOI10.1145/321784.321790zbMATH Open0277.68017OpenAlexW2003383684MaRDI QIDQ4403715FDOQ4403715
Author name not available (Why is that?)
Publication date: 1973
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321784.321790
Cited In (11)
- Optimal product and server locations in one-dimensional storage racks
- Near-optimal heuristics for an assignment problem in mass storage
- A two-carousel storage location problem
- The generalized Banach match-box problem: Application in disc storage management
- Product location, allocation and server home base location for an order picking line with multiple servers.
- Asymptotic miss ratios over independent references
- Dynamic placement of records and the classical occupancy problem
- Optimization and approximation algorithm for placement of records on linear storage devices
- An efficient algorithm for allocating paged, drum-like storage
- Analysis of set-up time models: a metric perspective
- A majorization theorem for the number of distinct outcomes in N independent trials
This page was built for publication: On the Optimality of the Probability Ranking Scheme in Storage Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4403715)
