Fluid analysis of an input control problem

A two-station network with controllable inputs and sequencing control, proposed by Wein (Oper. Res. 38:1065–1078, 1990), is analyzed. A control is sought to minimize holding cost subject to a throughput constraint. In a Lagrangian formulation, input vanishes in the fluid limit. Several alternative fluid models, including workload formulations, are analyzed to develop a heuristic policy for the stochastic network. Both the fluid heuristic and Wein’s diffusion solution are compared with the optimal policy by solving the dynamic program. Examples with up to six customer classes, using Poisson arrival and service processes, are presented. The fluid heuristic does well at sequencing control but the diffusion gives additional, and better, information on input control. The fluid analysis, in particular whether the fluid priorities are greedy, aids in determining whether the fluid heuristic contains useful information.

[1]  C. Maglaras.  Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality , 2000 .

[2]  David Gamarnik,et al.  From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective , 2003, Oper. Res..

[3]  Sean P. Meyn.  Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations , 2003, SIAM J. Control. Optim..

[4]  Hong Chen,et al.  Dynamic Scheduling of a Multiclass Fluid Network , 1993, Oper. Res..

[5]  Hong Chen,et al.  Discrete Flow Networks: Bottleneck Analysis and Fluid Approximations , 1991, Math. Oper. Res..

[6]  Gideon Weiss,et al.  A simplex based algorithm to solve separated continuous linear programs , 2008, Math. Program..

[7]  Hong Chen,et al.  Performance evaluation of scheduling control of queueing networks: Fluid model heuristics , 1995, Queueing Syst. Theory Appl..

[8]  E. Altman.  Constrained Markov Decision Processes , 1999 .

[9]  Elena Yudovina,et al.  Stochastic networks , 1995, Physics Subject Headings (PhySH).

[10]  Stanley B. Gershwin.  Analysis and Modeling of Manufacturing Systems , 2003 .

[11]  Michael J. Ricard.  Optimization of queueing networks : an optimal control appraoch , 1995 .

[12]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[13]  Lawrence M. Wein,et al.  Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Network with Controllable Inputs , 2011, Oper. Res..

[14]  Lawrence M. Wein,et al.  Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs , 1990, Oper. Res..

[15]  D. Bertsimas,et al.  A New Algorithm for State-Constrained Separated Continuous Linear Programs , 1999 .

[16]  Sean P. Meyn.  Sequencing and Routing in Multiclass Queueing Networks Part I: Feedback Regulation , 2001, SIAM J. Control. Optim..

[17]  Gideon Weiss,et al.  Scheduling jobshops with some identical or similar jobs , 2001 .

[18]  Gideon Weiss,et al.  On optimal draining of re-entrant fluid lines , 1995 .

[19]  F. Kelly,et al.  Stochastic networks : theory and applications , 1996 .

[20]  N. Bäuerle.  Asymptotic optimality of tracking policies in stochastic networks , 2001 .

[21]  Ann Appl,et al.  On the Positive Harris Recurrence for Multiclass Queueing Networks: a Uniied Approach via Uid Limit Models , 1999 .

[22]  Hong Chen.  Fluid Approximations and Stability of Multiclass Queueing Networks: Work-Conserving Disciplines , 1995 .

[23]  John N. Tsitsiklis,et al.  Optimization of multiclass queuing networks: polyhedral and nonlinear characterizations of achievable performance , 1994 .

[24]  Ioannis Ch. Paschalidis,et al.  Target-pursuing scheduling and routing policies for multiclass queueing networks , 2004, IEEE Transactions on Automatic Control.

[25]  Sean P. Meyn,et al.  Fluid Network Models: Linear Programs for Control and Performance Bounds , 1996 .

[26]  Michael H. Veatch,et al.  Using Fluid Solutions in Dynamic Scheduling , 2003 .

[27]  John Michael Harrison,et al.  Balanced fluid models of multiclass queueing networks: a heavy traffic conjecture , 1995 .

[28]  Gideon Weiss,et al.  An algorithm for minimum wait drainingof two‐station fluid re‐entrant line , 1999, Ann. Oper. Res..

[29]  Florin Avram,et al.  Fluid models of sequencing problems in open queueing networks; an optimal control approach , 1995 .

[30]  Lawrence M. Wein,et al.  Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network , 1990, Oper. Res..

[31]  Michael H. Veatch,et al.  Fluid analysis of arrival routing , 2001, IEEE Trans. Autom. Control..