New Results on Online Replacement Problem
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...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 563 |
|---|---|
| container_issue | |
| container_start_page | 554 |
| container_title | |
| container_volume | |
| creator | Xu, Yinfeng Xin, Chunlin Yi, Fanglei |
| description | 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. |
| doi_str_mv | 10.1007/11600930_55 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17415136</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17415136</sourcerecordid><originalsourceid>FETCH-LOGICAL-g250t-5a158d7f723e22524cd57f4dca0a8dc9e52fd7c9bd5f1286b78236664835db3c3</originalsourceid><addsrcrecordid>eNpNULtOwzAUNS-JtjDxA1kYOgTu9fUjHlFVHlJFEYLZcmynCqRJFQch_p6gdmA6T53hMHaFcIMA-hZRARgCK-URm5IUQJyP-phNUCHmRMKcHAIwAOKUTUbGc6MFnbNpSh8AwLXhEzZ_jt_Za0xfzZCyrs3WbVO3cXR2jfNxG9she-m7sonbC3ZWuSbFywPO2Pv98m3xmK_WD0-Lu1W-4RKGXDqURdCV5hQ5l1z4IHUlgnfgiuBNlLwK2psyyAp5oUpdcFJKiYJkKMnTjF3vd3cueddUvWt9neyur7eu_7GoBUokNfbm-14ao3YTe1t23WeyCPbvJfvvJfoFFnZS5Q</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>New Results on Online Replacement Problem</title><source>Springer Books</source><creator>Xu, Yinfeng ; Xin, Chunlin ; Yi, Fanglei</creator><contributor>Ye, Yinyu ; Deng, Xiaotie</contributor><creatorcontrib>Xu, Yinfeng ; Xin, Chunlin ; Yi, Fanglei ; Ye, Yinyu ; Deng, Xiaotie</creatorcontrib><description>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.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540309004</identifier><identifier>ISBN: 9783540309000</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540322930</identifier><identifier>EISBN: 9783540322931</identifier><identifier>DOI: 10.1007/11600930_55</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Changeover Time ; Characterization Theorem ; Competitive Algorithm ; Competitive Ratio ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Information systems. Data bases ; Memory organisation. Data processing ; Operational research and scientific management ; Operational research. Management science ; Portfolio theory ; Replacement Cost ; Software</subject><ispartof>Internet and Network Economics, 2005, p.554-563</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2006 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11600930_55$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11600930_55$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17415136$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Ye, Yinyu</contributor><contributor>Deng, Xiaotie</contributor><creatorcontrib>Xu, Yinfeng</creatorcontrib><creatorcontrib>Xin, Chunlin</creatorcontrib><creatorcontrib>Yi, Fanglei</creatorcontrib><title>New Results on Online Replacement Problem</title><title>Internet and Network Economics</title><description>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.</description><subject>Applied sciences</subject><subject>Changeover Time</subject><subject>Characterization Theorem</subject><subject>Competitive Algorithm</subject><subject>Competitive Ratio</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>Information systems. Data bases</subject><subject>Memory organisation. Data processing</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Portfolio theory</subject><subject>Replacement Cost</subject><subject>Software</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540309004</isbn><isbn>9783540309000</isbn><isbn>3540322930</isbn><isbn>9783540322931</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2005</creationdate><recordtype>book_chapter</recordtype><recordid>eNpNULtOwzAUNS-JtjDxA1kYOgTu9fUjHlFVHlJFEYLZcmynCqRJFQch_p6gdmA6T53hMHaFcIMA-hZRARgCK-URm5IUQJyP-phNUCHmRMKcHAIwAOKUTUbGc6MFnbNpSh8AwLXhEzZ_jt_Za0xfzZCyrs3WbVO3cXR2jfNxG9she-m7sonbC3ZWuSbFywPO2Pv98m3xmK_WD0-Lu1W-4RKGXDqURdCV5hQ5l1z4IHUlgnfgiuBNlLwK2psyyAp5oUpdcFJKiYJkKMnTjF3vd3cueddUvWt9neyur7eu_7GoBUokNfbm-14ao3YTe1t23WeyCPbvJfvvJfoFFnZS5Q</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Xu, Yinfeng</creator><creator>Xin, Chunlin</creator><creator>Yi, Fanglei</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>New Results on Online Replacement Problem</title><author>Xu, Yinfeng ; Xin, Chunlin ; Yi, Fanglei</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-g250t-5a158d7f723e22524cd57f4dca0a8dc9e52fd7c9bd5f1286b78236664835db3c3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Changeover Time</topic><topic>Characterization Theorem</topic><topic>Competitive Algorithm</topic><topic>Competitive Ratio</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>Information systems. Data bases</topic><topic>Memory organisation. Data processing</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Portfolio theory</topic><topic>Replacement Cost</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Xu, Yinfeng</creatorcontrib><creatorcontrib>Xin, Chunlin</creatorcontrib><creatorcontrib>Yi, Fanglei</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Xu, Yinfeng</au><au>Xin, Chunlin</au><au>Yi, Fanglei</au><au>Ye, Yinyu</au><au>Deng, Xiaotie</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>New Results on Online Replacement Problem</atitle><btitle>Internet and Network Economics</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2005</date><risdate>2005</risdate><spage>554</spage><epage>563</epage><pages>554-563</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540309004</isbn><isbn>9783540309000</isbn><eisbn>3540322930</eisbn><eisbn>9783540322931</eisbn><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.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11600930_55</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Internet and Network Economics, 2005, p.554-563 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_17415136 |
| source | Springer Books |
| subjects | Applied sciences Changeover Time Characterization Theorem Competitive Algorithm Competitive Ratio Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Information systems. Data bases Memory organisation. Data processing Operational research and scientific management Operational research. Management science Portfolio theory Replacement Cost Software |
| title | New Results on Online Replacement Problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T05%3A52%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=New%20Results%20on%20Online%20Replacement%20Problem&rft.btitle=Internet%20and%20Network%20Economics&rft.au=Xu,%20Yinfeng&rft.date=2005&rft.spage=554&rft.epage=563&rft.pages=554-563&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540309004&rft.isbn_list=9783540309000&rft_id=info:doi/10.1007/11600930_55&rft_dat=%3Cpascalfrancis_sprin%3E17415136%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540322930&rft.eisbn_list=9783540322931&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |