{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:04:31Z","timestamp":1778270671207,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:00:00Z","timestamp":1649030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:00:00Z","timestamp":1649030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Queueing Syst"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s11134-021-09723-w","type":"journal-article","created":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T06:03:52Z","timestamp":1649052232000},"page":"93-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fluid limits for shortest job first with aging"],"prefix":"10.1007","volume":"101","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6492-6377","authenticated-orcid":false,"given":"Yonatan","family":"Shadmi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,4]]},"reference":[{"issue":"7","key":"9723_CR1","doi-asserted-by":"publisher","first-page":"2270","DOI":"10.1016\/j.spa.2017.09.009","volume":"128","author":"R Atar","year":"2018","unstructured":"Atar, R., Biswas, A., Kaspi, H.: Law of large numbers for the many-server earliest-deadline-first queue. Stoch. Process. Appl. 128(7), 2270\u20132296 (2018)","journal-title":"Stoch. Process. Appl."},{"issue":"1","key":"9723_CR2","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1214\/17-AAP1309","volume":"28","author":"R Atar","year":"2018","unstructured":"Atar, R., Biswas, A., Kaspi, H., Ramanan, K.: A Skorokhod map on measure-valued paths with applications to priority queues. Ann. Appl. Probab. 28(1), 418\u2013481 (2018)","journal-title":"Ann. Appl. Probab."},{"key":"9723_CR3","unstructured":"Atar, R., Shadmi, Y.: Fluid limits for earliest-deadline-first networks (2020)"},{"key":"9723_CR4","unstructured":"Bach, M.: The Design of the UNIX Operating System. Prentice-Hall International Editions. Prentice-Hall (1986)"},{"key":"9723_CR5","doi-asserted-by":"crossref","unstructured":"Bansal, N., Harchol-Balter, M.: Analysis of SRPT scheduling: investigating unfairness. In: Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems (SIGMETRICS 2001, Cambridge, MA, USA, June 16\u201320, 2011), pp. 279\u2013290. Association for Computing Machinery, Inc (2001)","DOI":"10.1145\/378420.378792"},{"key":"9723_CR6","first-page":"200","volume":"37","author":"HS Behera","year":"2012","unstructured":"Behera, H.S., Swain, B.K., Parida, A.K., Sahu, G.: A new proposed round robin with highest response ratio next (RRHRRN) scheduling algorithm for soft real time systems. Int. J. Eng. Adv. Technol. 37, 200\u2013206 (2012)","journal-title":"Int. J. Eng. Adv. Technol."},{"key":"9723_CR7","unstructured":"Birkhoff, G., Rota, G.: Ordinary Differential Equations, Introductions to Higher Mathematics. Wiley (1989)"},{"key":"9723_CR8","doi-asserted-by":"crossref","unstructured":"Cildoz, M., Mallor, F., Ibarra, A.: Analysing the Ed patient flow management problem by using accumulating priority queues and simulation-based optimization. In: 2018 Winter Simulation Conference (WSC), pp. 2107\u20132118 (2018)","DOI":"10.1109\/WSC.2018.8632323"},{"key":"9723_CR9","doi-asserted-by":"crossref","unstructured":"Dell\u2019Amico, M., Carra, D., Pastorelli, M., Michiardi, P.: Revisiting size-based scheduling with estimated job sizes. In: 2014 IEEE 22nd International Symposium on Modelling, Analysis Simulation of Computer and Telecommunication Systems, pp. 411\u2013420 (2014)","DOI":"10.1109\/MASCOTS.2014.57"},{"issue":"4","key":"9723_CR10","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(4), 880\u2013911 (2009)","journal-title":"Math. Oper. Res."},{"key":"9723_CR11","unstructured":"Feitelson, D.: Notes on Operating Systems. The Hebrew University of Jerusalem (2011)"},{"issue":"1","key":"9723_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/10-SSY016","volume":"1","author":"HC Gromoll","year":"2011","unstructured":"Gromoll, H.C., Kruk, L., Puha, A.L.: Diffusion limits for shortest remaining processing time queues. Stoch. Syst. 1(1), 1\u201316 (2011)","journal-title":"Stoch. Syst."},{"key":"9723_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s11134-011-9267-5","volume":"70","author":"M Gromoll","year":"2012","unstructured":"Gromoll, M., Keutel, H.C.: Invariance of fluid limits for the shortest remaining processing time and shortest job first policies. Queue. Syst. 70, 145\u2013164 (2012)","journal-title":"Queue. Syst."},{"key":"9723_CR14","first-page":"07","volume":"49","author":"M Harchol-Balter","year":"2003","unstructured":"Harchol-Balter, M., Sigman, K., Wierman, A.: Asymptotic convergence of scheduling policies with respect to slowdown. Perform. Eval. 49, 07 (2003)","journal-title":"Perform. Eval."},{"issue":"3\u20134","key":"9723_CR15","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1002\/nav.3800110306","volume":"11","author":"L Kleinrock","year":"1964","unstructured":"Kleinrock, L.: A delay dependent queue discipline. Naval Res. Log. Q. 11(3\u20134), 329\u2013341 (1964)","journal-title":"Naval Res. Log. Q."},{"issue":"1","key":"9723_CR16","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/opre.15.1.104","volume":"15","author":"L Kleinrock","year":"1967","unstructured":"Kleinrock, L., Finkelstein, R.P.: Time dependent priority queues. Oper. Res. 15(1), 104\u2013116 (1967)","journal-title":"Oper. Res."},{"issue":"2","key":"9723_CR17","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1214\/10-AAP681","volume":"21","author":"L Kruk","year":"2011","unstructured":"Kruk, L., Lehoczky, J., Ramanan, K., Shreve, S.: Heavy traffic analysis for EDF queues with reneging. Ann. Appl. Probab. 21(2), 484\u2013545 (2011)","journal-title":"Ann. Appl. Probab."},{"issue":"6","key":"9723_CR18","doi-asserted-by":"publisher","first-page":"1712","DOI":"10.1287\/opre.2017.1613","volume":"65","author":"N Li","year":"2017","unstructured":"Li, N., Stanford, D.A., Taylor, P., Ziedins, I.: Nonlinear accumulating priority queues with equivalent linear proxies. Oper. Res. 65(6), 1712\u20131721 (2017)","journal-title":"Oper. Res."},{"issue":"3","key":"9723_CR19","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1287\/opre.9.3.383","volume":"9","author":"JDC Little","year":"1961","unstructured":"Little, J.D.C.: A proof for the queuing formula: $$L = \\lambda w$$. Oper. Res. 9(3), 383\u2013387 (1961)","journal-title":"Oper. Res."},{"key":"9723_CR20","unstructured":"Mirtchev, S., Goleva, R.: Evaluation of Pareto\/D\/1\/K queue by simulation. International Book Series \u201cInformation Science and Computing\u201d No. 1, Supplement to the International Journal \u201cInformation Technologies and Knowledge\u201d (2008)"},{"issue":"2","key":"9723_CR21","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 G\/G\/1 SRPT queue. Queue. Syst.: Theory Appl. 54(2), 85\u201397 (2006)","journal-title":"Queue. Syst.: Theory Appl."},{"issue":"6","key":"9723_CR22","doi-asserted-by":"publisher","first-page":"3381","DOI":"10.1214\/14-AAP1076","volume":"25","author":"AL Puha","year":"2015","unstructured":"Puha, A.L.: Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling. Ann. Appl. Probab. 25(6), 3381\u20133404 (2015)","journal-title":"Ann. Appl. Probab."},{"issue":"3","key":"9723_CR23","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1287\/opre.16.3.687","volume":"16","author":"L Schrage","year":"1968","unstructured":"Schrage, L.: Letter to the editor-a proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 16(3), 687\u2013690 (1968)","journal-title":"Oper. Res."},{"issue":"4","key":"9723_CR24","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1287\/opre.14.4.670","volume":"14","author":"LE 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(4), 670\u2013684 (1966)","journal-title":"Oper. Res."},{"key":"9723_CR25","unstructured":"Silberschatz, A., Galvin, P., Gagne, G.: Operating System Concepts. Windows XP Update. Wiley (2005)"},{"issue":"1","key":"9723_CR26","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1287\/opre.26.1.197","volume":"26","author":"DR Smith","year":"1978","unstructured":"Smith, D.R.: Technical note\u2014a new proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 26(1), 197\u2013199 (1978)","journal-title":"Oper. Res."},{"issue":"3","key":"9723_CR27","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11134-013-9382-6","volume":"77","author":"DA Stanford","year":"2014","unstructured":"Stanford, D.A., Taylor, P., Ziedins, I.: Waiting time distributions in the accumulating priority queue. Queue. Syst. 77(3), 297\u2013330 (2014)","journal-title":"Queue. Syst."}],"container-title":["Queueing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-021-09723-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11134-021-09723-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11134-021-09723-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T09:30:49Z","timestamp":1655458249000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11134-021-09723-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,4]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["9723"],"URL":"https:\/\/doi.org\/10.1007\/s11134-021-09723-w","relation":{},"ISSN":["0257-0130","1572-9443"],"issn-type":[{"value":"0257-0130","type":"print"},{"value":"1572-9443","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,4]]},"assertion":[{"value":"16 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}