Rent or buy problems with a fixed time horizon
From MaRDI portal
Publication:2345983
DOI10.1007/s00224-014-9552-xzbMath1328.68315OpenAlexW2163874442MaRDI QIDQ2345983
Leah Epstein, Hanan Zebedat-Haider
Publication date: 29 May 2015
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-014-9552-x
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items
Online leasing problem with price fluctuations and the second-hand transaction, Lease or financial lease? Deterministic strategies for on-line financial lease problem with the second-hand transaction, Competitive analysis for two-option online leasing problem under sharing economy, Online scheduling of unit jobs on three machines with rejection: a tight result, A Risk–Reward Model for On-line Financial Leasing Problem with an Interest Rate, Online leasing problem with price fluctuations under the consumer price index
Cites Work
- Optimal randomized algorithm for a generalized ski-rental with interest rate
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs
- Online scheduling with rejection and withdrawal
- Online scheduling of unit jobs on three machines with rejection: a tight result
- Ski rental with two general options
- Competitive snoopy caching
- Competitive randomized algorithms for nonuniform problems
- Dynamic TCP acknowledgment and other stories about \(e/(e-1)\)
- On capital investment.
- Competitive optimal on-line leasing
- A risk-reward model for the on-line leasing of depreciable equipment
- The ski-rental problem with multiple discount options
- Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental
- Price Fluctuations: To Buy or to Rent
- Caching Content under Digital Rights Management
- The On-Line Rental Problem with Risk and Probabilistic Forecast
- Nearly Optimal Competitive Online Replacement Policies
- Multiprocessor Scheduling with Rejection
- Preemptive multiprocessor scheduling with rejection
- On the Bahncard problem
