On the Optimality of the Probability Ranking Scheme in Storage Applications
From MaRDI portal
Publication:4403715
DOI10.1145/321784.321790zbMath0277.68017OpenAlexW2003383684MaRDI QIDQ4403715
No author found.
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
Related Items (11)
The generalized Banach match-box problem: Application in disc storage management ⋮ Dynamic placement of records and the classical occupancy problem ⋮ Optimization and approximation algorithm for placement of records on linear storage devices ⋮ Near-optimal heuristics for an assignment problem in mass storage ⋮ Product location, allocation and server home base location for an order picking line with multiple servers. ⋮ Analysis of set-up time models: a metric perspective ⋮ Asymptotic miss ratios over independent references ⋮ An efficient algorithm for allocating paged, drum-like storage ⋮ A majorization theorem for the number of distinct outcomes in N independent trials ⋮ Optimal product and server locations in one-dimensional storage racks ⋮ A two-carousel storage location problem
This page was built for publication: On the Optimality of the Probability Ranking Scheme in Storage Applications
