Optimal list order under partial memory constraints

DOI10.2307/3213210zbMath0449.90056OpenAlexW4256477035MaRDI QIDQ3896833

Y. C. Kan, Sheldon M. Ross

Publication date: 1980

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

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

zbMATH Keywords

randomizationsequencingtime reversibilitytransposition ruleoptimal list orderpartial memory constraints

Mathematics Subject Classification ID

Operations research and management science (90B99)

Related Items

The k-in-a-row procedure in selection theory ⋮ Self-organizing sequential search and Hilbert's inequalities ⋮ A Transposition Rule Analysis Based on a Particle Process ⋮ An exact formula for the move-to-front rule for self-organizing lists ⋮ Deterministic optimal and expedient move-to-rear list organizing strategies ⋮ A dynamic location problem for graphs ⋮ Processor Reordering Rules ⋮ MOVE-FORWARD RULES AND f-SWAP RULES APPLIED TO A COMMUNICATION PROBLEM

This page was built for publication: Optimal list order under partial memory constraints