Capacity management for a leasing system with different equipment and batch demands
研究了租赁系统面对两种设备和三种批量需求时的准入与容量分配问题，目标是最大化期望折现收益，并提出了最优策略的结构与求解算法。
This work explores the admission and capacity allocation for a leasing system with two types of equipment and three kinds of batch demands: elementary specified, premium specified, and unspecified demands. The demands arrive following mutually independent Poisson processes, and the rental duration of equipment follows a negative exponential distribution. The lessor can satisfy partially the specified demands with the required type of equipment and satisfy partially the unspecified demands with any type of equipment. The objective is to maximize the expected discounted revenue. We formulate this problem as a Markov decision process, prove the anti‐multimodularity of the value function, and characterize the structure of the optimal policy. We show that the optimal policy has a simple structure and is characterized by state‐dependent rationing and priority thresholds. Moreover, a solution algorithm is proposed to calculate the optimal policy. We study the impacts of the system state on the optimal action and find that the optimal action has limited sensitivity to the system state. Numerical studies are conducted to compare the performance of the optimal policy with that of two heuristic methods and to derive some managerial insights by analysis. We further discuss batch acceptance.