Data Driven Block Replacement Scheduling
We develop data driven algorithms for maintaining $N$ independent identical machines under a \textit{block replacement policy}, in which each machine is replaced upon failure and all machines are jointly replaced at regular intervals of length $k$. The goal is to learn the cost minimizing interval $k^ $ from operational data when the lifetime distribution is unknown. At each decision epoch, the operator selects $k...