Skip to main navigation Skip to search Skip to main content

New results on online replacement problem

  • Xi'an Jiaotong University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationInternet and Network Economics - First International Workshop, WINE 2005, Proceedings
PublisherSpringer Verlag
Pages554-563
Number of pages10
ISBN (Print)3540309004, 9783540309000
DOIs
StatePublished - 2005
Event1st International Workshop on Internet and Network Economics, WINE 2005 - Hong Kong, China
Duration: 15 Dec 200517 Dec 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3828 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference1st International Workshop on Internet and Network Economics, WINE 2005
Country/TerritoryChina
CityHong Kong
Period15/12/0517/12/05

Fingerprint

Dive into the research topics of 'New results on online replacement problem'. Together they form a unique fingerprint.

Cite this