Stochastic Clearing Systems with Multiple Input Processes

In this paper, we consider stochastic clearing systems with multiple drifted Brownian motion inputs. First, we propose an instantaneous rate policy, which is shown to be the optimal one among a large class of renewal type clearing policies in terms of average cost. Second, we propose a service measure about average weighted delay rate, and provide a unified method to calculate the service measure under different clearing policies. Moreover, we prove that under a fixed clearing frequency, the instantaneous rate policy outperforms a large class of clearing policies, and the instantaneous rate hybrid policy performs better than time-based policy, in terms of average weighted delay rate.

[1]  Sila Çetinkaya,et al.  Coordination of Inventory and Shipment Consolidation Decisions: A Review of Premises, Models, and Justification , 2005 .

[2]  James K. Higginson,et al.  Markovian Decision Processes in Shipment Consolidation , 1995, Transp. Sci..

[3]  Shaler Stidham,et al.  Clearing Systems and (s, S) Inventory Systems with Nonlinear Costs and Positive Lead Times , 1986, Oper. Res..

[4]  B. D. Sivazlian,et al.  Distributions and first moments of the busy and idle periods in controllable M/G/1 Queueing Models with Simple and Dyadic Policies , 1995 .

[5]  Fatih Mutlu,et al.  On the service performance of alternative shipment consolidation policies , 2014, Oper. Res. Lett..

[6]  J. Harrison,et al.  Brownian Models of Performance and Control , 2013 .

[7]  Shaler Stidham,et al.  Stochastic clearing systems , 1974 .

[8]  Charles S. Tapiero,et al.  Random vehicle dispatching with options and optimal fleet size , 1980 .

[9]  Sila Çetinkaya,et al.  Stochastic Models for the Dispatch of Consolidated Shipments , 2003 .

[10]  Jesus R. Artalejo,et al.  A note on the optimality of the N- and D-policies for the M/G/1 queue , 2002, Oper. Res. Lett..

[11]  Sheldon M. Ross OPTIMAL DISPATCHING OF A POISSON PROCESS , 1969 .

[12]  Kashi R. Balachandran,et al.  Control Policies for a Single Server System , 1973 .

[13]  Ward Whitt The Stationary Distribution of a Stochastic Clearing Process , 1981, Oper. Res..

[14]  Qi-Ming He,et al.  Shipment Consolidation by Private Carrier: The Discrete Time and Discrete Quantity Case , 2011 .

[15]  Chung-Yee Lee,et al.  A comparison of outbound dispatch policies for integrated inventory and transportation decisions , 2006, Eur. J. Oper. Res..

[16]  Fatih Mutlu,et al.  An analytical model for computing the optimal time-and-quantity-based policy for consolidated shipments , 2010 .

[17]  Shaler Stidham,et al.  Cost Models for Stochastic Clearing Systems , 1977, Oper. Res..

[18]  K. Athreya,et al.  Measure Theory and Probability Theory , 2006 .

[19]  Daniel P. Heyman,et al.  Optimal Operating Policies for M/G/1 Queuing Systems , 1968, Oper. Res..

[20]  Offer Kella,et al.  Optimality of D-Policies for an M/G/1 Queue with a Removable Server , 2002, Queueing Syst. Theory Appl..

[21]  Andreas Winkelbauer,et al.  Moments and Absolute Moments of the Normal Distribution , 2012, ArXiv.

[22]  James K. Higginson,et al.  Policy Recommendations for a Shipment-Consolidation Program , 2015 .

[23]  O. J. Boxma,et al.  Note---Note on a Control Problem of Balachandran and Tijms , 1976 .

[24]  M. Yadin,et al.  Queueing Systems with a Removable Service Station , 1963 .

[25]  Panagiotis Kasteridis,et al.  On the d-policy for the m/g/1 queue , 2001 .

[26]  Chung-Yee Lee,et al.  Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems , 2000 .

[27]  Offer Kella,et al.  A STOCHASTIC CLEARING MODEL WITH A BROWNIAN AND A COMPOUND POISSON COMPONENT , 2003, Probability in the Engineering and Informational Sciences.

[28]  Charles S. Tapiero,et al.  A simple vehicle dispatching policy with non-stationary stochastic arrival rates , 1982 .

[29]  Rosa E. Lillo,et al.  On optimal exhaustive policies for the M/G/1-queue , 2000, Oper. Res. Lett..

[30]  Charles S. Tapiero,et al.  Vehicle dispatching with competition , 1979 .