M / G /1 Queues with Scheduling within Generations and Removable Server

J. G. Shanthikumar
Additional contact information
J. G. Shanthikumar: University of Toronto, Toronto, Ontario, Canada

Operations Research, 1981, vol. 29, issue 5, 1010-1018

Abstract: Two models of M / G /1 queues with removable server and scheduling within generations are considered in this paper. The scheduling policy considered here is the shortest processing time; the control policies are the multiple vacations policy and N -control policy. The Laplace-Stieltjes transforms of the waiting time distribution, the mean cost rates and the optimal control policies are derived for these two models. Properties of the delayed busy cycle are used in our analysis.

Keywords: 681 M/G/1 queue; 585 job shop with secondary production; 698 scheduling within generations (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.5.1010 (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:oropre:v:29:y:1981:i:5:p:1010-1018

Access Statistics for this article

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