Online Resource Allocation with Limited Flexibility

We consider a class of online resource allocation problems in which there are n types of resources with limited initial inventory and n demand classes. The resources are flexible in that each type of resources can serve more than one demand class. In this paper, we focus on a special class of structures with limited flexibility, the long chain design, which was proposed by Jordan and Graves (1995) and has been an important concept in the design of sparse flexible processes. We study the long chain design in an online stochastic environment where the requests are drawn repeatedly and independently from a known probability distribution over the different demand classes. Also, the decision on how to address each request must be made immediately upon its arrival. We show the effectiveness of the long chain design in mitigating supply-demand mismatch under a simple myopic online allocation policy. In particular, we provide an upper bound on the expected total number of lost sales that is irrespective of how large the market size is.

[1]  Richard M. Karp,et al.  An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

[2]  John A. Buzacott,et al.  Flexibility in manufacturing and services: achievements, insights and challenges , 2008 .

[3]  Michael Mitzenmacher,et al.  The Power of Two Choices in Randomized Load Balancing , 2001, IEEE Trans. Parallel Distributed Syst..

[4]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

[5]  Jeffrey Considine,et al.  Simple Load Balancing for Distributed Hash Tables , 2003, IPTPS.

[6]  Rina Panigrahy,et al.  Balanced allocation on graphs , 2005, SODA '06.

[7]  Leandros Tassiulas,et al.  Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.

[8]  Zizhuo Wang,et al.  A Dynamic Near-Optimal Algorithm for Online Linear Programming , 2009, Oper. Res..

[9]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[10]  Patrick Jaillet,et al.  Online Stochastic Matching: New Algorithms with Better Bounds , 2014, Math. Oper. Res..

[11]  Marco Ajmone Marsan,et al.  Bounds on average delays and queue size averages and variances in input-queued cell-based switches , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[12]  Benjamin Van Roy,et al.  A neuro-dynamic programming approach to retailer inventory management , 1997, Proceedings of the 36th IEEE Conference on Decision and Control.

[13]  Amos Fiat,et al.  On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.

[14]  Zygmunt J. Haas,et al.  On the impact of alternate path routing for load balancing in mobile ad hoc networks , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[15]  Huan Zheng,et al.  On the Performance of Sparse Process Structures in Partial Postponement Production Systems , 2014, Oper. Res..

[16]  Eytan Modiano,et al.  Dynamic power allocation and routing for time-varying wireless networks , 2005 .

[17]  Eli Upfal,et al.  Balanced Allocations , 1999, SIAM J. Comput..

[18]  Martin Raab,et al.  "Balls into Bins" - A Simple and Tight Analysis , 1998, RANDOM.

[19]  Aranyak Mehta,et al.  AdWords and generalized on-line matching , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[20]  Mahesh K. Marina,et al.  On-demand multipath distance vector routing in ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[21]  Aranyak Mehta,et al.  Online Stochastic Matching: Beating 1-1/e , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.