{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:26:53Z","timestamp":1761647213580,"version":"3.43.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Queueing Systems"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1023\/a:1019106530558","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T18:30:27Z","timestamp":1045679427000},"page":"289-315","source":"Crossref","is-referenced-by-count":18,"title":["Threshold-based interventions to optimize performance in preemptive priority queues"],"prefix":"10.1007","volume":"35","author":[{"given":"Steve","family":"Drekic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David A.","family":"Stanford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"329618_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/opre.30.1.97","volume":"30","author":"I. Adiri","year":"1982","unstructured":"I. Adiri and I. Domb, A single server queueing system working under mixed priority disciplines, Oper. Res. 30 (1982) 97\u2013115.","journal-title":"Oper. Res."},{"key":"329618_CR2","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0377-2217(84)90266-2","volume":"18","author":"I. Adiri","year":"1984","unstructured":"I. Adiri and I. Domb, Mixing of nonpreemptive and preemptive repeat priority disciplines, European J. Oper. Res. 18 (1984) 86\u201397.","journal-title":"European J. Oper. Res."},{"key":"329618_CR3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1002\/zamm.19640440603","volume":"6","author":"B. Avi-Itzhak","year":"1964","unstructured":"B. Avi-Itzhak, I. Brosh and P. Naor, On discretionary priority queueing, Z. Angew. Math. Mech. 6 (1964) 235\u2013242.","journal-title":"Z. Angew. Math. Mech."},{"key":"329618_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF00365393","volume":"3","author":"T.P. Baker","year":"1991","unstructured":"T.P. Baker, Stack-based scheduling of realtime processes, Real-Time Systems 3 (1991) 67\u201399.","journal-title":"Real-Time Systems"},{"key":"329618_CR5","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1287\/opre.13.5.820","volume":"13","author":"W. Chang","year":"1965","unstructured":"W. Chang, Preemptive priority queues, Oper. Res. 13 (1965) 820\u2013827.","journal-title":"Oper. Res."},{"key":"329618_CR6","doi-asserted-by":"crossref","unstructured":"Y.Z. Cho, An efficient priority-scheduling algorithm for integrated services packet networks, Ph.D. dissertation, Korea Advanced Institute of Science and Technology (1988).","DOI":"10.1049\/el:19880285"},{"key":"329618_CR7","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1109\/26.212373","volume":"41","author":"Y.Z. Cho","year":"1993","unstructured":"Y.Z. Cho and C.K. Un, Analysis of the M\/G\/1 queue under a combined preemptive\/nonpreemptive priority discipline, IEEE Trans. Commun. 41 (1993) 132\u2013141.","journal-title":"IEEE Trans. Commun."},{"key":"329618_CR8","volume-title":"Theory of Scheduling","author":"R.W. Conway","year":"1967","unstructured":"R.W. Conway, W.L. Maxwell and L.W. Miller, Theory of Scheduling (Addison-Wesley, Reading, MA, 1967)."},{"key":"329618_CR9","unstructured":"J.N. Daigle and S.D. Whitehead, Transmission facility sharing for integrated services, in: Proc. for the IEEE INFOCOM '84 (1984) pp. 236\u2013245."},{"key":"329618_CR10","unstructured":"S. Drekic and D.A. Stanford, Reducing delay in preemptive repeat priority queues, Oper. Res., to appear."},{"key":"329618_CR11","volume-title":"Analysis and Synthesis of Computer Systems","author":"E. Gelenbe","year":"1980","unstructured":"E. Gelenbe and I. Mitrani, Analysis and Synthesis of Computer Systems (Academic Press, London, 1980)."},{"key":"329618_CR12","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1109\/TCOM.1986.1096548","volume":"34","author":"C. Goerg","year":"1986","unstructured":"C. Goerg, Evaluation of the optimal SRPT strategy with overhead, IEEE Trans. Commun. 34 (1986) 338\u2013344.","journal-title":"IEEE Trans. Commun."},{"key":"329618_CR13","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/S0169-7552(97)00115-3","volume":"29","author":"S.H. Hong","year":"1997","unstructured":"S.H. Hong and H. Takagi, Analysis of transmission delay for a structured-priority packet-switching system, Comput. Networks ISDN Systems 29 (1997) 701\u2013715.","journal-title":"Comput. Networks ISDN Systems"},{"key":"329618_CR14","volume-title":"Priority Queues","author":"N.K. Jaiswal","year":"1968","unstructured":"N.K. Jaiswal, Priority Queues (Academic Press, New York, 1968)."},{"key":"329618_CR15","first-page":"312","volume":"60","author":"H. Kesten","year":"1957","unstructured":"H. Kesten and J.Th. Runnenburg, Priority in waiting line problems, I and II, Proc. Koninkl. Nederlandse Akademie van Wetenschappen Series A 60 (1957) 312\u2013324 and 325\u2013336.","journal-title":"Priority in waiting line problems, I and II, Proc. Koninkl. Nederlandse Akademie van Wetenschappen Series A"},{"key":"329618_CR16","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1002\/nav.3800110306","volume":"11","author":"L. Kleinrock","year":"1964","unstructured":"L. Kleinrock, A delay dependent queue discipline, Naval Res. Logistics Quart. 11 (1964) 329\u2013341.","journal-title":"Naval Res. Logistics Quart."},{"key":"329618_CR17","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0166-5316(82)90024-4","volume":"2","author":"J.Y.T. Leung","year":"1982","unstructured":"J.Y.T. Leung and J. Whitehead, On the complexity of fixed-priority scheduling of periodic real-time tasks, Performance Evaluation 2 (1982) 237\u2013250.","journal-title":"Performance Evaluation"},{"key":"329618_CR18","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"C.L. Liu","year":"1973","unstructured":"C.L. Liu and J.W. Layland, Scheduling algorithms for multiprogramming in a hard-real-time environment, J. Assoc. Comput. Mach. 20 (1973) 46\u201361.","journal-title":"J. Assoc. Comput. Mach."},{"key":"329618_CR19","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1287\/opre.42.6.1146","volume":"42","author":"M. Paterok","year":"1994","unstructured":"M. Paterok and A. Ettl, Sojourn time and waiting time distributions for M\/G\/1 queues with preemption-distance priorities, Oper. Res. 42 (1994) 1146\u20131161.","journal-title":"Oper. Res."},{"key":"329618_CR20","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1109\/T-C.1969.222569","volume":"18","author":"L. Schrage","year":"1969","unstructured":"L. Schrage, Analysis and optimization of a queueing model of a real-time computer control system, IEEE Trans. Comput. 18 (1969) 997\u20131003.","journal-title":"IEEE Trans. Comput."},{"key":"329618_CR21","volume-title":"Queueing Analysis: A Foundation of Performance Evaluation, Vol. 1: Vacation and Priority Systems","author":"H. Takagi","year":"1991","unstructured":"H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation, Vol. 1: Vacation and Priority Systems, Part 1 (North-Holland, Amsterdam, 1991)."},{"key":"329618_CR22","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01149179","volume":"22","author":"H. Takagi","year":"1996","unstructured":"H. Takagi and Y. Kodera, Analysis of preemptive loss priority queues with preemption distance,Queueing Systems 22 (1996) 367\u2013381.","journal-title":"Queueing Systems"}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019106530558.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019106530558\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019106530558.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T04:28:07Z","timestamp":1754454487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019106530558"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":22,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["329618"],"URL":"https:\/\/doi.org\/10.1023\/a:1019106530558","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"type":"print","value":"0257-0130"},{"type":"electronic","value":"1572-9443"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}