 Leasing with UncertaintyChristine Markarian ()
A chapter in Operations Research Proceedings 2017, 2018, pp 429-434 from Springer Abstract: Abstract Theoretical study of real-life leasing scenarios was initiated in 2005 with a simple leasing model defined as follows. Demands arrive with time and need to be served by leased resources. Different types of leases are available, each with a fixed duration and price, respecting economy of scale (longer leases cost less per unit time). An algorithm is to lease resources at minimum possible costs in order to serve each arriving demand, without knowing future demands. In this paper, we generalize this model and introduce the Lease-or-Decline and Lease-or-Delay leasing models. In the Lease-or-Decline model, not all demands need to be served, i.e., the algorithm may decline a demand as long as a penalty associated with it is paid. In the Lease-or-Delay model, each demand has a deadline and can be served any day before its deadline as long as a penalty is paid for each delayed day. The goal is to minimize the total cost of purchased leases and penalties paid. For each of these models we give a deterministic online primal-dual algorithm, evaluated using the standard competitive analysis in which an online algorithm is compared to the optimal offline algorithm which knows the entire sequence of demands in advance and is optimal. Date: 2018 There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it. Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-89920-6_57 Ordering information: This item can be ordered from DOI: 10.1007/978-3-319-89920-6_57 Access Statistics for this chapter More chapters in Operations Research Proceedings from Springer |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.