Abstract
This paper considers multi-period warehousing contracts under random space demand. A typical contract is specified by a starting space commitment plus a certain number of times at which the commitment can be further modified. Three forms of contracts are analysed: (1) there is a restriction on the range of commitment changes and the schedule for the changes is preset by the warehouser; (2) the same as form (1) but there is no restriction on the range; (3) the same as form (2) but the schedule for the changes is chosen by the user. We explore properties and algorithms for the three problems from the user's perspective. Solutions of simple form are obtained for the first two models and an efficient dynamic programming (DP) procedure is proposed for the last. A numerical comparison of the total expected leasing costs suggests that under certain demand patterns, contract forms (2) and (3) could be cost effective. © 2001 Elsevier Science B.V.
| Original language | English |
|---|---|
| Pages (from-to) | 603-610 |
| Journal | European Journal of Operational Research |
| Volume | 131 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 16 Jun 2001 |
| Externally published | Yes |
Research Keywords
- Dynamic programming
- Stochastic processes
- Third-party logistics
- Warehousing contracts
Fingerprint
Dive into the research topics of 'Analysis of third-party warehousing contracts with commitments'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver