Technical Note—The Queue M / G /1 When Jobs Are Scheduled within Generations

T. M. O'Donovan
Additional contact information
T. M. O'Donovan: University College, Cork, Ireland

Operations Research, 1975, vol. 23, issue 4, 821-824

Abstract: This note studies queuing systems in which jobs are scheduled for service within generations. Mean conditional waiting times are derived for systems where the queue discipline within each generation is shortest processing time first or processor-shared round robin.

Date: 1975
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.23.4.821 (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:23:y:1975:i:4:p:821-824

Access Statistics for this article

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