Event submissions
In this paper, we consider simple opportunity-based block replacement problems, where the inter-arrival times of replacement opportunities arrvie randomly. We give two replacement models under replacement first and replacement last disciplines in the sense of Zhao and Nakagawa (2012). Then, we derivethe optimal opportunity-based block replacemnt policies under replacement first and replacement last disciples. Furthermore, numerical examples are presented to compare these repacement polices.