The replacement problems are extensively studied from a number of disciplines including economics, finance, operations research, and decision theory. Much of previous theoretical work is "Bayesian". In this paper, we restudy the on-line replacement problem by using the competitive analysis. The goal is to minimize the total cost of cumulative payment flow plus changeover costs. Firstly, a refusal strategy is proposed and the competitive ratio for k = 1 is obtained. Furthermore, a new time-independent strategy Snew is presented and we prove that it is r-competitive when M ∈ [c, d]. Finally, weights are introduced to the original model and some results are achieved. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Xu, Y., Xin, C., & Yi, F. (2005). New results on online replacement problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3828 LNCS, pp. 554–563). Springer Verlag. https://doi.org/10.1007/11600930_55
Mendeley helps you to discover research relevant for your work.