Publication Type

Journal Article

Version

acceptedVersion

Publication Date

3-2022

Abstract

A key challenge in the resource allocation problem is to find near-optimal policies to serve different customers with random demands/revenues, using a fixed pool of capacity (properly configured). In this paper, we study the properties of three classes of allocation policies-responsive (with perfect hindsight), adaptive (with information updates), and anticipative (with forecast information) policies. These policies differ in how the information on actual demand and revenue of each customer is being revealed and integrated into the allocation decisions. We show that the analysis of these policies can be unified through the notion of "persistency" (or service level) values-the probability that a customer is being (completely) served in the optimal responsive policy. We analyze and compare the performances of these policies for both capacity minimization (with given persistency targets) and revenue maximization (with given capacity) models. In both models, the performance gaps between optimal anticipative policies and adaptive policies are shown to be bounded when the demand and revenue of each item are independently generated. In contrast, the gaps between the optimal adaptive policies and responsive policies can be arbitrarily large. More importantly, we show that the techniques developed, and the persistency values obtained from the optimal responsive policies can be used to design good adaptive and anticipative policies for the other two variants of resource allocation problems. This provides a unified approach to the design and analysis of algorithms for these problems.

Keywords

stochastic knapsack, resource allocation, capacity pooling, service level, persistency value

Discipline

Operations and Supply Chain Management | Operations Research, Systems Engineering and Industrial Engineering

Research Areas

Operations Management

Publication

Operations Research

Volume

70

Issue

2

First Page

729

Last Page

747

ISSN

0030-364X

Identifier

10.1287/opre.2021.2173

Publisher

INFORMS (Institute for Operations Research and Management Sciences)

Copyright Owner and License

Authors

Additional URL

https://doi.org/10.1287/opre.2021.2173

Download

Share

COinS