Please use this identifier to cite or link to this item:
|Title:||Performance modeling of supply chains using queueing networks|
|Authors:||Viswanadham, N. |
|Source:||Viswanadham, N.,Raghavan, N.R.S. (2001). Performance modeling of supply chains using queueing networks. Proceedings - IEEE International Conference on Robotics and Automation 1 : 529-534. ScholarBank@NUS Repository.|
|Abstract:||Supply chain networks are formed out of complex interactions amongst several companies whose aim is to produce and deliver goods to the customers at the time and place specified by them. Computing the total lead time for customer orders entering such a complex network of companies is an important exercise. In this paper, we present analytical models for evaluating the average lead times of make-to-order supply chains. In particular, we illustrate the use of fork-join queueing networks to compute the mean and variance of the lead time. The existing literature on approximate methods of analysis of fork-join queueing systems assume heavy traffic and require tedious computations. We present two applications of a tractable approximate analytical method for lead time computations in a class of fork-join queueing systems. For the case where the arrivals are deterministic and service times are normally distributed, we present an easy to use approximate method. Specifically, we illustrate the use of the above met hod in setting service levels in assemble-to-order type supply chains.|
|Source Title:||Proceedings - IEEE International Conference on Robotics and Automation|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.