Previous article Next article Finite-Source Priority QueuesN. K. Jaiswal and K. ThiruvengadamN. K. Jaiswal and K. Thiruvengadamhttps://doi.org/10.1137/0115111PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] B. Avi-Itzhak, Preemptive repeat priority queues as a special case of the multipurpose server problem. I, II, Operations Res. 11 (1963), 597-609; ibid., 11 (1963), 610–619 MR0162294 0114.09204 CrossrefISIGoogle Scholar[2] B. Avi-Itzhak and , P. Naor, Some queuing problems with the service station subject to breakdown, Operations Res., 11 (1963), 303–320 MR0162293 0114.34202 CrossrefISIGoogle Scholar[3] Sven Erlander, The remaining busy period for a single server queue with Poisson input, Operations Res., 13 (1965), 734–746 MR0185695 0147.16803 CrossrefISIGoogle Scholar[4] Donald P. Gaver, Jr., Imbedded Markov chain analysis of a waiting-line process in continuous time, Ann. Math. Statist., 30 (1959), 698–720 MR0107913 0087.33601 CrossrefGoogle Scholar[5] D. P. Gaver, Jr., A waiting line with interrupted service, including priorities, J. Roy. Statist. Soc. Ser. B, 24 (1962), 73–90 MR0141173 0108.31403 Google Scholar[6] N. K. Jaiswal, Finite-source queuing models, Memo 45, Case Institute of Technology, Cleveland, Ohio, 1966 Google Scholar[7] N. K. Jaiswal, Priority queues, Mathematics in Science and Engineering, Vol. 50, Academic Press, New York, 1968xiii+240 MR0237014 0179.47904 Google Scholar[8] Julian Keilson, Queues subject to service interruption, Ann. Math. Statist., 33 (1962), 1314–1322 MR0141172 0104.36805 CrossrefGoogle Scholar[9] Walter L. Smith, Asymptotic renewal theorems, Proc. Roy. Soc. Edinburgh. Sect. A., 64 (1954), 9–48 MR0060755 0055.12402 Google Scholar[10] K. Thiruvengadam, A generalization of queuing with breakdowns, Defence Sci. J., 14 (1964), 1–16 Google Scholar[11] K. Thiruvengadam, Masters Thesis, Studies in waiting line problems, Doctoral thesis, University of Delhi, Delhi, India, 1965 Google Scholar[12] K. Thiruvengadam and , N. K. Jaiswal, A priority assignment in machine interference problem, Opsearch (India), 1 (1964), 197–216 0139.37105 Google Scholar[13] Wei Chang, Preemptive priority queues, Operations Res., 13 (1965), 820–827 MR0185691 0212.24402 CrossrefISIGoogle Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Queueing Theory1 December 2016 Cross Ref Mathematical Modeling and Performance Analysis of Machine Repairable System with Hot Spares7 January 2015 | Proceedings of the National Academy of Sciences, India Section A: Physical Sciences, Vol. 85, No. 1 Cross Ref A cyclic-service finite source model with round-robin schedulingQueueing Systems, Vol. 11, No. 1-2 Cross Ref A carrier sensed multiple access protocol high data rate ring networksACM SIGCOMM Computer Communication Review, Vol. 21, No. 2 Cross Ref Naval Research Logistics (NRL), Vol. 37, No. 3 Cross Ref On the heterogeneous machine interference problem with priority and ordinary machinesEuropean Journal of Operational Research, Vol. 41, No. 1 Cross Ref Queueing theoryJournal of Soviet Mathematics, Vol. 2, No. 1 Cross Ref Volume 15, Issue 5| 1967SIAM Journal on Applied Mathematics History Submitted:21 March 1966Published online:13 July 2006 InformationCopyright © 1967 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0115111Article page range:pp. 1278-1293ISSN (print):0036-1399ISSN (online):1095-712XPublisher:Society for Industrial and Applied Mathematics