{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:08:07Z","timestamp":1743016087521,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030271800"},{"type":"electronic","value":"9783030271817"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-27181-7_16","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:10:06Z","timestamp":1566429006000},"page":"263-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Diffusion Limits for SRPT and LRPT Queues via EDF Approximations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3073-959X","authenticated-orcid":false,"given":"\u0141ukasz","family":"Kruk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,23]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1145\/384268.378792","volume":"29","author":"N Bansal","year":"2001","unstructured":"Bansal, N., Harchol-Balter, M.: Analysis of SRPT scheduling: investigating unfairness. ACM Sigmetrics Perform. Eval. Rev. 29, 279\u2013290 (2001)","journal-title":"ACM Sigmetrics Perform. Eval. Rev."},{"key":"16_CR2","unstructured":"Bender, M., Chakrabarti, S., Muthukrishnan, S.: Flow and stretch metrics for scheduling continuous job streams. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (1998)"},{"key":"16_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316962","volume-title":"Convergence of Probability Measures","author":"P Billingsley","year":"1999","unstructured":"Billingsley, P.: Convergence of Probability Measures, 2nd edn. Wiley, New York (1999)","edition":"2"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1287\/moor.1090.0409","volume":"34","author":"DG Down","year":"2009","unstructured":"Down, D.G., Gromoll, H.C., Puha, A.L.: Fluid limits for shortest remaining processing time queues. Math. Oper. Res. 34, 880\u2013911 (2009)","journal-title":"Math. Oper. Res."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s11134-006-7419-9","volume":"53","author":"DG Down","year":"2006","unstructured":"Down, D.G., Wu, R.: Multi-layered round robin routing for parallel servers. Queueing Syst. 53, 177\u2013188 (2006)","journal-title":"Queueing Syst."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1214\/aoap\/1015345295","volume":"11","author":"B Doytchinov","year":"2001","unstructured":"Doytchinov, B., Lehoczky, J.P., Shreve, S.E.: Real-time queues in heavy traffic with earliest-deadline-first queue discipline. Ann. Appl. Probab. 11, 332\u2013378 (2001)","journal-title":"Ann. Appl. Probab."},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1214\/105051604000000035","volume":"14","author":"HC Gromoll","year":"2004","unstructured":"Gromoll, H.C.: Diffusion approximation for a processor sharing queue in heavy traffic. Ann. Appl. Probab. 14, 555\u2013611 (2004)","journal-title":"Ann. Appl. Probab."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s11134-011-9267-5","volume":"70","author":"HC Gromoll","year":"2012","unstructured":"Gromoll, H.C., Keutel, M.: Invariance of fluid limits for the shortest remaining processing time and shortest job first policies. Queueing Syst. 70, 145\u2013164 (2012)","journal-title":"Queueing Syst."},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/10-SSY016","volume":"1","author":"HC Gromoll","year":"2011","unstructured":"Gromoll, H.C., Kruk, \u0141., Puha, A.L.: Diffusion limits for shortest remaining processing time queues. Stoch. Syst. 1(1), 1\u201316 (2011)","journal-title":"Stoch. Syst."},{"key":"16_CR10","volume-title":"Markov Processes: Characterization and Convergence","author":"SN Ethier","year":"1985","unstructured":"Ethier, S.N., Kurtz, T.G.: Markov Processes: Characterization and Convergence. Wiley, New York (1985)"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/3518347","volume":"2","author":"D Iglehart","year":"1970","unstructured":"Iglehart, D., Whitt, W.: Multiple channel queues in heavy traffic I. Adv. Appl. Probab. 2, 150\u2013177 (1970)","journal-title":"Adv. Appl. Probab."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1287\/mnsc.1040.0301","volume":"51","author":"T Kittsteiner","year":"2005","unstructured":"Kittsteiner, T., Moldovanu, B.: Priority auctions and queue disciplines that depend on processing time. Manage. Sci. 51, 236\u2013248 (2005)","journal-title":"Manage. Sci."},{"key":"16_CR13","first-page":"51","volume":"61","author":"\u0141 Kruk","year":"2007","unstructured":"Kruk, \u0141.: Diffusion approximation for a G\/G\/1 EDF queue with unbounded lead times. Ann. UMCS Math. A 61, 51\u201390 (2007)","journal-title":"Ann. UMCS Math. A"},{"issue":"3","key":"16_CR14","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1287\/moor.2015.0768","volume":"41","author":"\u0141 Kruk","year":"2016","unstructured":"Kruk, \u0141., Soko\u0142owska, E.: Fluid limits for multiple-input shortest remaining processing time queues. Math. Oper. Res. 41(3), 1055\u20131092 (2016)","journal-title":"Math. Oper. Res."},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1020905810996","volume":"113","author":"R N\u00fa\u00f1ez Queija","year":"2002","unstructured":"N\u00fa\u00f1ez Queija, R.: Queues with equally heavy sojourn time and service requirement distributions. Ann. Oper. Res. 113, 101\u2013117 (2002)","journal-title":"Ann. Oper. Res."},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s11134-006-8767-1","volume":"54","author":"M Nuyens","year":"2006","unstructured":"Nuyens, M., Zwart, B.: A large deviations analysis of the GI\/GI\/1 SRPT queue. Queueing Syst. 54, 85\u201397 (2006)","journal-title":"Queueing Syst."},{"key":"16_CR17","unstructured":"Pavlov, A.V.: A system with Schrage servicing discipline in the case of a high load. Engrg. Cybernetics 21, 114\u2013121 (1984). translated from Izv: Akad. Nauk SSSR Tekhn. Kibernet. 6, 59\u201366 (1983). (Russian)"},{"key":"16_CR18","unstructured":"Pechinkin, A.V.: Heavy traffic in a system with a discipline of priority servicing for the job with the shortest remaining length with interruption (Russian). Math. Issled. No. 89, Veroyatn. Anal. 97, 85\u201393 (1986)"},{"key":"16_CR19","unstructured":"Perera, R.: The variance of delay time in queueing system M\/G\/1 with optimal strategy SRPT. Archiv f\u00fcr Elektronik und \u00dcbertragungstechnik 47, 110\u2013114 (1993)"},{"issue":"6","key":"16_CR20","doi-asserted-by":"publisher","first-page":"3381","DOI":"10.1214\/14-AAP1076","volume":"25","author":"Amber L. Puha","year":"2015","unstructured":"Puha, A.L.: Diffusion limits for shortest remaining processing time queues under nonstandard spacial scaling. Ann. Appl. Probab. 25(6), 3301\u20133404 (2015)","journal-title":"The Annals of Applied Probability"},{"issue":"02","key":"16_CR21","doi-asserted-by":"publisher","first-page":"456","DOI":"10.2307\/1427545","volume":"22","author":"R. Schassberger","year":"1990","unstructured":"Schassberger, R.: The steady-state appearance of the M\/G\/1 queue under the discipline of shortest remaining processing time. Adv. Appl. Probab. 22, 456\u2013479 (1990)","journal-title":"Advances in Applied Probability"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Schrage, L.E.: A proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 16, 687\u2013690 (1968)","DOI":"10.1287\/opre.16.3.687"},{"issue":"4","key":"16_CR23","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1287\/opre.14.4.670","volume":"14","author":"Linus E. Schrage","year":"1966","unstructured":"Schrage, L.E., Miller, L.W.: The queue M\/G\/1 with the shortest remaining processing time discipline. Oper. Res. 14, 670\u2013684 (1966)","journal-title":"Operations Research"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Wierman, A., Harchol-Balter, M.: Classifying scheduling policies with respect to unfairness in an M\/G\/1. In: Proceedings of the 2003 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, pp. 238\u2013249 (2003)","DOI":"10.1145\/781027.781057"}],"container-title":["Lecture Notes in Computer Science","Queueing Theory and Network Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27181-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:24:47Z","timestamp":1710350687000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27181-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030271800","9783030271817"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27181-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"QTNA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Queueing Theory and Network Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ghent","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"qtna2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/qtna2019.ugent.be\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}