Approximations for Networks of Queues with Overtime

Gabriel R. Bitran and Devanath Tirupati
Additional contact information
Gabriel R. Bitran: Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
Devanath Tirupati: Department of Management, The University of Texas at Austin, Austin, Texas 78712

Management Science, 1991, vol. 37, issue 3, 282-300

Abstract: This paper presents simple approximations for networks of queues with overtime operation at some stations. This type of network is commonly encountered in several manufacturing applications. We provide bounds on the performance of the approximations for single and multiple machine stations. Our results suggest that the methods perform satisfactorily. These approximations can be used in conjunction with parametric decomposition methods to analyze queueing networks. The computational results indicate that the performance of the decomposition approach does not deteriorate when combined with the methods proposed in this paper.

Keywords: queueing networks with overtime; approximations; departure process (search for similar items in EconPapers)
Date: 1991
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.37.3.282 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:37:y:1991:i:3:p:282-300

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().