IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v73y2022i10p2186-2203.html
   My bibliography  Save this article

Dynamic allocation and pricing for capacitated stochastic container leasing systems with dynamic arrivals

Author

Listed:
  • Wen Jiao

Abstract

Container leasing is a flourishing industry characterised by multiple-unit demand, monopolistic supply, and long-standing customer relationships. The constraints imposed by a finite capacity and dynamic customer arrivals mean that leasing companies must address allocation and pricing issues. In this study, we investigate the dynamic rationing and nonlinear pricing problem for a leasing company with high-type and low-type customers (differentiated by per-time valuation for the leasing service) who first arrive randomly at the company and have specific hire duration preferences. We derive the closed-form optimal rationing and pricing policy, and also discuss the effect of capacity constraints and customer dynamic arrivals on the optimal allocation policy. In the setting with the same hire duration preference, the capacity constraint has a greater effect over time for customers with the same entry date and dynamic customer arrivals accelerate the increasing effect of capacity constraints compared with the case of simultaneous entries. In the setting with different hire duration preferences, the effect of the capacity constraint increases for the low-type customers and decreases for the high-type customers. Dynamic arrivals only exacerbate the increasing effect of the capacity constraint for consistent low-type customers.

Suggested Citation

  • Wen Jiao, 2022. "Dynamic allocation and pricing for capacitated stochastic container leasing systems with dynamic arrivals," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 73(10), pages 2186-2203, October.
  • Handle: RePEc:taf:tjorxx:v:73:y:2022:i:10:p:2186-2203
    DOI: 10.1080/01605682.2021.1960906
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2021.1960906
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2021.1960906?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tjorxx:v:73:y:2022:i:10:p:2186-2203. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.