The transposition replacement policy with a partial memory
Consider as a model for any serial list a bookshelf with books B1, ···, Bn. At each unit of time book is demanded with probability pi and is replaced one position to the left of where it was removed (or in the same position if it is already at the left-hand end). If this transposition is made only when Bi has been demanded k times in a row, we show that the average position of the next book demanded is a monotone decreasing function of k.
1982 ◽
Vol 19
(03)
◽
pp. 733-736
◽
1992 ◽
Vol 50
(1)
◽
pp. 540-541
1989 ◽
Vol 47
◽
pp. 1024-1025
Keyword(s):
Keyword(s):
2015 ◽
Vol 74
(1)
◽
pp. 55-60
◽
Keyword(s):
2003 ◽
Vol 17
(2)
◽
pp. 69-86
◽
Keyword(s):
2010 ◽
Vol 57
(4)
◽
pp. 308-314
◽
Keyword(s):
Keyword(s):