{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T17:04:38Z","timestamp":1779555878200,"version":"3.53.1"},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.orl.2026.107459","type":"journal-article","created":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T15:01:25Z","timestamp":1777474885000},"page":"107459","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Preemption can destabilize the system performance"],"prefix":"10.1016","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3073-959X","authenticated-orcid":false,"given":"\u0141ukasz","family":"Kruk","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2026.107459_bib0001","series-title":"Scheduling","author":"Pinedo","year":"2012"},{"key":"10.1016\/j.orl.2026.107459_bib0002","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/321738.321743","article-title":"Scheduling algorithms for multiprogramming in a hard real-time environment","volume":"20","author":"Liu","year":"1973","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/j.orl.2026.107459_bib0003","series-title":"Technical Report","article-title":"On the optimality of the STE rule for multiple server queues that serve customers with deadlines","author":"Panwar","year":"1988"},{"key":"10.1016\/j.orl.2026.107459_bib0004","series-title":"Second ORSA Telecommunications Conference","article-title":"Optimality of the stochastic earliest deadline policy for the G\/M\/c queue serving customers with deadlines","author":"Panwar","year":"1992"},{"key":"10.1016\/j.orl.2026.107459_bib0005","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1214\/10-AAP681","article-title":"Heavy traffic analysis for EDF queues with reneging","volume":"21","author":"Kruk","year":"2011","journal-title":"Ann. Appl. Probab."},{"key":"10.1016\/j.orl.2026.107459_bib0006","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1287\/opre.16.3.687","article-title":"A proof of the optimality of the shortest remaining processing time discipline","volume":"16","author":"Schrage","year":"1968","journal-title":"Oper. Res."},{"key":"10.1016\/j.orl.2026.107459_bib0007","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1287\/opre.26.1.197","article-title":"A new proof of the optimality of the shortest remaining processing time discipline","volume":"26","author":"Smith","year":"1976","journal-title":"Oper. Res."},{"key":"10.1016\/j.orl.2026.107459_bib0008","series-title":"Operating Systems: Internals and Design Principles","author":"Stallings","year":"2018"},{"key":"10.1016\/j.orl.2026.107459_bib0009","series-title":"Lecture Notes in Mathematics","article-title":"Stability of Queueing Networks","volume":"1950","author":"Bramson","year":"2008"},{"key":"10.1016\/j.orl.2026.107459_bib0010","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1023\/A:1017987600517","article-title":"Stability of earliest-due-date, first-served queueing networks","volume":"39","author":"Bramson","year":"2001","journal-title":"Queueing Syst. Theory Appl."},{"key":"10.1016\/j.orl.2026.107459_bib0011","first-page":"105","article-title":"Stability of preemptive EDF queueing networks","volume":"73","author":"Kruk","year":"2019","journal-title":"Ann. Univ. Mariae Curie-Sk\u0142odowska Math. A."},{"key":"10.1016\/j.orl.2026.107459_bib0012","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s11134-021-09733-8","article-title":"Instability of SRPT, SERPT and SJF queueing networks","volume":"101","author":"Chojecki","year":"2022","journal-title":"Queueing Syst. Theory Appl."},{"key":"10.1016\/j.orl.2026.107459_bib0013","series-title":"Performance Evaluation Methodologies and Tools. VALUETOOLS 2024. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","first-page":"105","article-title":"Instability of some LJF and LRTF queueing networks","volume":"663","author":"Chojecki","year":"2026"},{"key":"10.1016\/j.orl.2026.107459_bib0014","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.orl.2023.02.010","article-title":"Instability of LRTF multiclass queueing networks","volume":"51","author":"Kruk","year":"2023","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.orl.2026.107459_bib0015","series-title":"Processing Networks: Fluid Models and Stability","author":"Dai","year":"2020"},{"key":"10.1016\/j.orl.2026.107459_bib0016","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.peva.2005.07.008","article-title":"Stability of size-based scheduling disciplines in resource-sharing networks","volume":"62","author":"Verloop","year":"2005","journal-title":"Perform. Eval."},{"key":"10.1016\/j.orl.2026.107459_bib0017","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.1287\/moor.2023.0090","article-title":"Fluid limits for longest remaining time first queues","volume":"49","author":"Kruk","year":"2024","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.orl.2026.107459_bib0018","article-title":"Fluid limits for longest job first queues","author":"Kruk","year":"2025","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.orl.2026.107459_bib0019","series-title":"Proceedings of the INFOCOM 2009, Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies","first-page":"1395","article-title":"Bandwidth sharing: objectives and algorithms","volume":"3","author":"Massouli\u00e9","year":"1999"},{"key":"10.1016\/j.orl.2026.107459_bib0020","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1023\/A:1019138827659","article-title":"Bandwidth sharing and admission control for elastic traffic","volume":"15","author":"Massouli\u00e9","year":"2000","journal-title":"Telecommun. Syst."},{"key":"10.1016\/j.orl.2026.107459_bib0021","series-title":"Proceedings of ACM Sigmetrics","first-page":"82","article-title":"Impact of fairness on internet performance","author":"Bonald","year":"2001"},{"key":"10.1016\/j.orl.2026.107459_bib0022","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/s11134-006-7588-6","article-title":"Fluid models of integrated traffic and multipath routing","volume":"53","author":"Key","year":"2006","journal-title":"Queueing Syst. Theory Appl."},{"key":"10.1016\/j.orl.2026.107459_bib0023","series-title":"IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications","first-page":"901","article-title":"Stability of networks with age-based scheduling","author":"Brown","year":"2007"},{"key":"10.1016\/j.orl.2026.107459_bib0024","series-title":"IMS Collections 4, Markov Processes and Related Topics: A Festschrift for Thomas G. Kurtz","first-page":"253","article-title":"Fluid model for a data network with \u03b1-fair bandwidth sharing and general document size distributions: two examples of stability","volume":"4","author":"Gromoll","year":"2008"},{"key":"10.1016\/j.orl.2026.107459_bib0025","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1214\/09-AAP649","article-title":"Network stability under max-min fair bandwidth sharing","volume":"20","author":"Bramson","year":"2010","journal-title":"Ann. Appl. Probab."},{"key":"10.1016\/j.orl.2026.107459_bib0026","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1287\/13-SSY130","article-title":"Resource sharing networks: overview and an open problem","volume":"4","author":"Harrison","year":"2014","journal-title":"Stoch. Syst."},{"key":"10.1016\/j.orl.2026.107459_bib0027","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s11134-017-9553-y","article-title":"Stability of linear EDF networks with resource sharing","volume":"88","author":"Kruk","year":"2018","journal-title":"Queueing Syst. Theory Appl."},{"key":"10.1016\/j.orl.2026.107459_bib0028","doi-asserted-by":"crossref","first-page":"1889","DOI":"10.1109\/9.471210","article-title":"Stability and convergence of moments for multiclass queueing networks via fluid limit models","volume":"40","author":"Dai","year":"1995","journal-title":"IEEE Trans. Automat. Control"},{"key":"10.1016\/j.orl.2026.107459_bib0029","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1090\/conm\/149\/01273","article-title":"Generalized resolvents and Harris recurrence of Markov processes","volume":"149","author":"Meyn","year":"1993","journal-title":"Contemp. Math."},{"key":"10.1016\/j.orl.2026.107459_bib0030","series-title":"S\u00e9minaire de Probabilit\u00e9s XIV","first-page":"397","article-title":"Transience and recurrence of Markov processes","author":"Getoor","year":"1979"},{"key":"10.1016\/j.orl.2026.107459_bib0031","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00531519","article-title":"Mesure invariante sur les classes r\u00e9currentes des processus de Markov","volume":"8","author":"Az\u00e9ma","year":"1967","journal-title":"Z. F\u00fcr Wahrscheinlichkeitstheorie Verwandte Geb."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000568?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000568?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T16:17:38Z","timestamp":1779553058000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637726000568"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":31,"alternative-id":["S0167637726000568"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2026.107459","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Preemption can destabilize the system performance","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.orl.2026.107459","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107459"}}