A counterexample to a conjecture on optimal list ordering

DOI10.2307/3213536zbMath0488.60096OpenAlexW4252079428MaRDI QIDQ3949784

Peter Nash, Richard R. Weber, Edward J. Anderson

Publication date: 1982

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

Full work available at URL: https://doi.org/10.2307/3213536

zbMATH Keywords

memory constraintstransposition ruleoptimal list order

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (4)

Self-organizing sequential search and Hilbert's inequalities ⋮ A Transposition Rule Analysis Based on a Particle Process ⋮ The Move-to-Front Rule for Multiple Lists ⋮ Processor Reordering Rules

This page was built for publication: A counterexample to a conjecture on optimal list ordering