Lešanovsky, A. On optimal replacement policy. (English) Zbl 0531.90039 Statistics and probability, Proc. 3rd Pannonian Symp., Visegrád/Hung. 1982, 167-181 (1984). Summary: [For the entire collection see Zbl 0527.00024.] A system with a single activated unit which can be in \(k+1\) states 0,1,...,k is considered. Inspections of the system are carried out at discrete time instants \(n=0,1,2,..\). At these moments it is possible to replace the unit by another one whose state is better than that of the inspected unit. The algorithm suggested in the paper for finding the replacement strategy which is optimal in the sense of average income per unit time among all the \(k(k+1)/2\) possible ones requests to investigate not more than 2k of them. MSC: 90B25 Reliability, availability, maintenance, inspection in operations research Keywords:system with finitely many states; discrete time inspections; optimal replacement strategy; single activated unit; algorithm Citations:Zbl 0527.00024 PDFBibTeX XML