Ravikumar, K and Narahari, Y (1994) Dynamic scheduling in manufacturing systems using brownian approximations. In: Sadhana :academy proceedings in engineering sciences, 19 (6). pp. 891-939.
dynamic_2.pdf - Published Version
Recently, Brownian networks have emerged as an effective stochastic model to approximate multiclass queueing networks with dynamic scheduling capability, under conditions of balanced heavy loading. This paper is a tutorial introduction to dynamic scheduling in manufacturing systems using Brownian networks. The article starts with motivational examples. It then provides a review of relevant weak convergence concepts, followed by a description of the limiting behaviour of queueing systems under heavy traffic. The Brownian approximation procedure is discussed in detail and generic case studies are provided to illustrate the procedure and demonstrate its effectiveness. This paper places emphasis only on the results and aspires to provide the reader with an up-to-date understanding of dynamic scheduling based on Brownian approximations.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Indian Academy of Sciences.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||01 Jun 2011 06:37|
|Last Modified:||01 Jun 2011 06:37|
Actions (login required)