Advertisement
Published in:
2005 | OriginalPaper | Chapter
New Results on Online Replacement Problem
Authors : Yinfeng Xu, Chunlin Xin, Fanglei Yi
Published in: Internet and Network Economics
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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
S
new
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.