{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T23:40:18Z","timestamp":1726098018533},"reference-count":74,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T00:00:00Z","timestamp":1697328000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Performance Evaluation"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1016\/j.peva.2023.102377","type":"journal-article","created":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T04:23:53Z","timestamp":1698553433000},"page":"102377","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Performance of the Gittins policy in the G\/G\/1 and G\/G\/k, with and without setup times"],"prefix":"10.1016","volume":"163","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-8534-1063","authenticated-orcid":false,"given":"Yige","family":"Hong","sequence":"first","affiliation":[]},{"given":"Ziv","family":"Scully","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.peva.2023.102377_b1","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."},{"issue":"1\u20134","key":"10.1016\/j.peva.2023.102377_b2","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/s11134-009-9141-x","article-title":"On the Gittins index in the M\/G\/1 queue","volume":"63","author":"Aalto","year":"2009","journal-title":"Queueing Syst."},{"issue":"3","key":"10.1016\/j.peva.2023.102377_b3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1017\/S0269964811000015","article-title":"Properties of the Gittins index with application to optimal scheduling","volume":"25","author":"Aalto","year":"2011","journal-title":"Probab. Engrg. Inform. Sci."},{"key":"10.1016\/j.peva.2023.102377_b4","series-title":"Multi-Armed Bandit Allocation Indices","author":"Gittins","year":"2011"},{"key":"10.1016\/j.peva.2023.102377_b5","series-title":"19th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt 2021)","first-page":"248","article-title":"The Gittins policy in the M\/G\/1 queue","author":"Scully","year":"2021"},{"issue":"3","key":"10.1016\/j.peva.2023.102377_b6","doi-asserted-by":"crossref","DOI":"10.1145\/3428328","article-title":"The Gittins policy is nearly optimal in the M\/G\/k under extremely general conditions","volume":"4","author":"Scully","year":"2020","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"issue":"3","key":"10.1016\/j.peva.2023.102377_b7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3570612","article-title":"Optimal scheduling in the multiserver-job model under heavy traffic","volume":"6","author":"Grosof","year":"2022","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"key":"10.1016\/j.peva.2023.102377_b8","series-title":"A New Toolbox for Scheduling Theory","author":"Scully","year":"2022"},{"issue":"1","key":"10.1016\/j.peva.2023.102377_b9","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1287\/mnsc.30.1.51","article-title":"Queues in which customers receive simultaneous service from a random number of servers: A system point approach","volume":"30","author":"Brill","year":"1984","journal-title":"Manage. Sci."},{"issue":"1","key":"10.1016\/j.peva.2023.102377_b10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s11134-020-09684-6","article-title":"Open problems in queueing theory inspired by datacenter computing","volume":"97","author":"Harchol-Balter","year":"2021","journal-title":"Queueing Syst."},{"issue":"1","key":"10.1016\/j.peva.2023.102377_b11","doi-asserted-by":"crossref","DOI":"10.1145\/3447385","article-title":"Zero queueing for multi-server jobs","volume":"5","author":"Wang","year":"2021","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"key":"10.1016\/j.peva.2023.102377_b12","series-title":"Sharp waiting-time bounds for multiserver jobs","author":"Hong","year":"2022"},{"issue":"1","key":"10.1016\/j.peva.2023.102377_b13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10479-015-1917-2","article-title":"Stability criterion of a multiserver model with simultaneous service","volume":"252","author":"Rumyantsev","year":"2017","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.peva.2023.102377_b14","article-title":"Three-level modeling of a speed-scaling supercomputer","author":"Rumyantsev","year":"2022","journal-title":"Ann. Oper. Res."},{"issue":"1\u20132","key":"10.1016\/j.peva.2023.102377_b15","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s11134-022-09848-6","article-title":"WCFS: A new framework for analyzing multiserver systems","volume":"102","author":"Grosof","year":"2022","journal-title":"Queueing Syst."},{"key":"10.1016\/j.peva.2023.102377_b16","series-title":"A First Course in Bulk Queues","author":"Chaudhry","year":"1983"},{"issue":"6","key":"10.1016\/j.peva.2023.102377_b17","doi-asserted-by":"crossref","first-page":"1368","DOI":"10.1287\/opre.32.6.1368","article-title":"A note on the M\/G\/1 queue with server vacations","volume":"32","author":"Fuhrmann","year":"1984","journal-title":"Oper. Res."},{"issue":"5","key":"10.1016\/j.peva.2023.102377_b18","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1287\/opre.33.5.1117","article-title":"Stochastic decompositions in the M\/G\/1 queue with generalized vacations","volume":"33","author":"Fuhrmann","year":"1985","journal-title":"Oper. Res."},{"key":"10.1016\/j.peva.2023.102377_b19","series-title":"Performance Modeling and Design of Computer Systems: Queueing Theory in Action","author":"Harchol-Balter","year":"2013"},{"key":"10.1016\/j.peva.2023.102377_b20","series-title":"Simple and explicit bounds for multi-server queues with universal 1\/(1\u2212\u03c1) scaling","author":"Li","year":"2017"},{"issue":"3","key":"10.1016\/j.peva.2023.102377_b21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3570617","article-title":"The M\/M\/k with deterministic setup times","volume":"6","author":"Williams","year":"2022","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"issue":"4","key":"10.1016\/j.peva.2023.102377_b22","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1287\/opre.49.4.609.11225","article-title":"Parallel scheduling of multiclass M\/M\/m queues: Approximate and heavy-traffic optimization of achievable performance","volume":"49","author":"Glazebrook","year":"2001","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.peva.2023.102377_b23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s001860300278","article-title":"An analysis of Klimov\u2019s problem with parallel servers","volume":"58","author":"Glazebrook","year":"2003","journal-title":"Math. Methods Oper. Res."},{"issue":"2","key":"10.1016\/j.peva.2023.102377_b24","doi-asserted-by":"crossref","first-page":"409","DOI":"10.2307\/3214660","article-title":"On extremal service disciplines in single-stage queueing systems","volume":"27","author":"Righter","year":"1990","journal-title":"J. Appl. Probab."},{"issue":"4","key":"10.1016\/j.peva.2023.102377_b25","doi-asserted-by":"crossref","first-page":"2587","DOI":"10.1214\/21-AAP1741","article-title":"Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions","volume":"32","author":"Banerjee","year":"2022","journal-title":"Ann. Appl. Probab."},{"issue":"10","key":"10.1016\/j.peva.2023.102377_b26","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1016\/j.peva.2011.06.001","article-title":"Heavy-traffic analysis of mean response time under shortest remaining processing time","volume":"68","author":"Lin","year":"2011","journal-title":"Perform. Eval."},{"key":"10.1016\/j.peva.2023.102377_b27","series-title":"Progress in Statistics","first-page":"241","article-title":"A dynamic allocation index for the sequential design of experiments","volume":"Number 9","author":"Gittins","year":"1974"},{"issue":"3","key":"10.1016\/j.peva.2023.102377_b28","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1017\/S0269964800001194","article-title":"Scheduling multiclass single server queueing systems to stochastically maximize the number of successful departures","volume":"3","author":"Righter","year":"1989","journal-title":"Probab. Engrg. Inform. Sci."},{"issue":"1","key":"10.1016\/j.peva.2023.102377_b29","doi-asserted-by":"crossref","DOI":"10.1145\/3179419","article-title":"SOAP: One clean analysis of all age-based scheduling policies","volume":"2","author":"Scully","year":"2018","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"issue":"1","key":"10.1016\/j.peva.2023.102377_b30","doi-asserted-by":"crossref","DOI":"10.1145\/3379477","article-title":"Simple near-optimal scheduling for the M\/G\/1","volume":"4","author":"Scully","year":"2020","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"key":"10.1016\/j.peva.2023.102377_b31","series-title":"Queueing Systems with Non-Standard Service Policies and Server Vacations","author":"van Vreumingen","year":"2019"},{"key":"10.1016\/j.peva.2023.102377_b32","doi-asserted-by":"crossref","DOI":"10.1016\/j.peva.2020.102150","article-title":"Optimal multiserver scheduling with unknown job sizes in heavy traffic","volume":"145","author":"Scully","year":"2021","journal-title":"Perform. Eval."},{"issue":"3","key":"10.1016\/j.peva.2023.102377_b33","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/263326.263344","article-title":"Exploiting process lifetime distributions for dynamic load balancing","volume":"15","author":"Harchol-Balter","year":"1997","journal-title":"ACM Trans. Comput. Syst."},{"key":"10.1016\/j.peva.2023.102377_b34","series-title":"Network Analysis without Exponentiality Assumptions","author":"Harchol-Balter","year":"1996"},{"issue":"6","key":"10.1016\/j.peva.2023.102377_b35","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1109\/90.650143","article-title":"Self-similarity in world wide web traffic: Evidence and possible causes","volume":"5","author":"Crovella","year":"1997","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.peva.2023.102377_b36","series-title":"Self-Similar Network Traffic and Performance Evaluation","year":"2000"},{"key":"10.1016\/j.peva.2023.102377_b37","series-title":"22nd International Computer Measurement Group Conference","first-page":"1034","article-title":"Data center I\/O patterns and power laws","author":"Peterson","year":"1996"},{"issue":"2","key":"10.1016\/j.peva.2023.102377_b38","doi-asserted-by":"crossref","DOI":"10.1145\/3392148","article-title":"Characterizing policies with optimal response time tails under heavy-tailed job sizes","volume":"4","author":"Scully","year":"2020","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"issue":"1\u20132","key":"10.1016\/j.peva.2023.102377_b39","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s11134-005-1740-6","article-title":"Analysis of a multiserver queue with setup times","volume":"51","author":"Artalejo","year":"2005","journal-title":"Queueing Syst."},{"key":"10.1016\/j.peva.2023.102377_b40","series-title":"M\/G\/k with Exponential Setup","first-page":"44","author":"Gandhi","year":"2009"},{"issue":"11","key":"10.1016\/j.peva.2023.102377_b41","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1016\/j.peva.2010.07.004","article-title":"Server farms with setup costs","volume":"67","author":"Gandhi","year":"2010","journal-title":"Perform. Eval."},{"issue":"4","key":"10.1016\/j.peva.2023.102377_b42","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/j.orl.2013.03.006","article-title":"M\/G\/k with staggered setup","volume":"41","author":"Gandhi","year":"2013","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"10.1016\/j.peva.2023.102377_b43","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s11134-014-9409-7","article-title":"Exact analysis of the M\/M\/k\/setup class of Markov chains via recursive renewal reward","volume":"77","author":"Gandhi","year":"2014","journal-title":"Queueing Syst."},{"key":"10.1016\/j.peva.2023.102377_b44","series-title":"Analytical and Stochastic Modelling Techniques and Applications, Vol. 9845","first-page":"253","article-title":"A law of large numbers for M\/M\/c\/Delayoff-Setup queues with nonstationary arrivals","author":"Pender","year":"2016"},{"issue":"5","key":"10.1016\/j.peva.2023.102377_b45","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/opre.12.5.736","article-title":"On a generalized M\/G\/1 queuing process in which the first customer of each busy period receives exceptional service","volume":"12","author":"Welch","year":"1964","journal-title":"Oper. Res."},{"issue":"2","key":"10.1016\/j.peva.2023.102377_b46","doi-asserted-by":"crossref","first-page":"419","DOI":"10.2307\/3213784","article-title":"A note on stochastic decomposition in a GI\/G\/1 queue with vacations or set-up times","volume":"22","author":"Doshi","year":"1985","journal-title":"J. Appl. Probab."},{"issue":"4","key":"10.1016\/j.peva.2023.102377_b47","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1023\/A:1013992708103","article-title":"Analysis of M\/G\/1-queues with setup times and vacations under six different service disciplines","volume":"39","author":"Bischof","year":"2001","journal-title":"Queueing Syst."},{"issue":"12","key":"10.1016\/j.peva.2023.102377_b48","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1016\/S0305-0548(98)00038-0","article-title":"On a batch arrival Poisson queue with a random setup time and vacation period","volume":"25","author":"Choudhury","year":"1998","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"10.1016\/j.peva.2023.102377_b49","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1080\/15326349508807367","article-title":"Flow time in the MAP\/G\/1 queue with customer batching and setup times","volume":"11","author":"He","year":"1995","journal-title":"Commun. Statist. Stoch. Models"},{"issue":"4","key":"10.1016\/j.peva.2023.102377_b50","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.2307\/3215331","article-title":"A new approach to the G\/G\/1 queue with generalized setup time and exhaustive service","volume":"31","author":"Li","year":"1994","journal-title":"J. Appl. Probab."},{"issue":"2","key":"10.1016\/j.peva.2023.102377_b51","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1080\/15326349408807301","article-title":"Decomposition formulas for single server queues with vacations : A unified approach by the rate conservation law","volume":"10","author":"Miyazawa","year":"1994","journal-title":"Commun. Statist. Stoch. Models"},{"issue":"1","key":"10.1016\/j.peva.2023.102377_b52","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01149327","article-title":"Queueing systems with vacations \u2013 a survey","volume":"1","author":"Doshi","year":"1986","journal-title":"Queueing Syst."},{"issue":"2","key":"10.1016\/j.peva.2023.102377_b53","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1504\/IJMOR.2016.077997","article-title":"Queueing systems with vacation: An overview","volume":"9","author":"Upadhyaya","year":"2016","journal-title":"Int. J. Math. Oper. Res."},{"issue":"4","key":"10.1016\/j.peva.2023.102377_b54","doi-asserted-by":"crossref","first-page":"949","DOI":"10.2307\/3214218","article-title":"Pseudo-conservation laws in cyclic-service systems","volume":"24","author":"Boxma","year":"1987","journal-title":"J. Appl. Probab."},{"issue":"2","key":"10.1016\/j.peva.2023.102377_b55","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1080\/15326349908807149","article-title":"Generalizations of the stochastic decomposition results for single server queues with vacations","volume":"6","author":"Doshi","year":"1990","journal-title":"Commun. Statist. Stoch. Models"},{"issue":"3","key":"10.1016\/j.peva.2023.102377_b56","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1287\/opre.1110.0940","article-title":"Little\u2019s law as viewed on its 50th anniversary","volume":"59","author":"Little","year":"2011","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.peva.2023.102377_b57","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1017\/S0305004100036781","article-title":"The stability of a queue with non-independent inter-arrival and service times","volume":"58","author":"Loynes","year":"1962","journal-title":"Math. Proc. Camb. Phil. Soc."},{"issue":"1","key":"10.1016\/j.peva.2023.102377_b58","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0002-9947-1955-0066587-3","article-title":"On the theory of queues with many servers","volume":"78","author":"Kiefer","year":"1955","journal-title":"Trans. Amer. Math. Soc."},{"issue":"1","key":"10.1016\/j.peva.2023.102377_b59","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1287\/moor.7.1.88","article-title":"Existence of limiting distributions in the GI\/GI\/s queue","volume":"7","author":"Whitt","year":"1982","journal-title":"Math. Oper. Res."},{"issue":"1","key":"10.1016\/j.peva.2023.102377_b60","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/moor.15.1.175","article-title":"One-dependent regenerative processes and queues in continuous time","volume":"15","author":"Sigman","year":"1990","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.peva.2023.102377_b61","series-title":"Stability Analysis of Regenerative Queueing Models: Mathematical Methods and Applications","author":"Morozov","year":"2021"},{"issue":"1","key":"10.1016\/j.peva.2023.102377_b62","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1287\/15-SSY199","article-title":"Heavy traffic approximation for the stationary distribution of a generalized Jackson network: The BAR approach","volume":"7","author":"Braverman","year":"2017","journal-title":"Stoch. Syst."},{"issue":"1","key":"10.1016\/j.peva.2023.102377_b63","first-page":"104","article-title":"Diffusion approximation for stationary analysis of queues and their networks: A review","volume":"58","author":"Miyazawa","year":"2015","journal-title":"J. Oper. Res. Soc. Japan"},{"key":"10.1016\/j.peva.2023.102377_b64","series-title":"13th Innovations in Theoretical Computer Science Conference (ITCS 2022)","article-title":"Uniform bounds for scheduling with job size estimates","author":"Scully","year":"2022"},{"issue":"1","key":"10.1016\/j.peva.2023.102377_b65","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11134-015-9454-x","article-title":"Rate conservation laws: A survey","volume":"15","author":"Miyazawa","year":"1994","journal-title":"Queueing Syst."},{"key":"10.1016\/j.peva.2023.102377_b66","series-title":"Applications of Mathematics","article-title":"Elements of Queueing Theory: Palm-Martingale Calculus and Stochastic Recurrences","author":"Baccelli","year":"2003"},{"key":"10.1016\/j.peva.2023.102377_b67","series-title":"Applied Probability and Queues","volume":"Number 51","author":"Asmussen","year":"2003"},{"issue":"1","key":"10.1016\/j.peva.2023.102377_b68","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1145\/1071690.1064236","article-title":"Nearly insensitive bounds on SMART scheduling","volume":"33","author":"Wierman","year":"2005","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"10.1016\/j.peva.2023.102377_b69","series-title":"Stability for two-class multiserver-job systems","author":"Grosof","year":"2020"},{"issue":"3","key":"10.1016\/j.peva.2023.102377_b70","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1239\/aap\/1059486828","article-title":"Idle period approximations and bounds for the GI\/G\/1 queue","volume":"35","author":"Wolff","year":"2003","journal-title":"Adv. Appl. Probab."},{"issue":"1","key":"10.1016\/j.peva.2023.102377_b71","doi-asserted-by":"crossref","first-page":"247","DOI":"10.2307\/3214933","article-title":"Characterizing the idle-period distribution of GI\/G\/1 queues","volume":"32","author":"Li","year":"1995","journal-title":"J. Appl. Probab."},{"key":"10.1016\/j.peva.2023.102377_b72","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.peva.2018.10.001","article-title":"SRPT for multiserver systems","volume":"127\u2013128","author":"Grosof","year":"2018","journal-title":"Perform. Eval."},{"issue":"2","key":"10.1016\/j.peva.2023.102377_b73","doi-asserted-by":"crossref","DOI":"10.1145\/3341617.3326157","article-title":"Load balancing guardrails: Keeping your heavy traffic on the road to low response times","volume":"3","author":"Grosof","year":"2019","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"key":"10.1016\/j.peva.2023.102377_b74","series-title":"Markov Chains and Stochastic Stability","author":"Meyn","year":"2009"}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531623000470?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166531623000470?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T21:13:04Z","timestamp":1712005984000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166531623000470"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":74,"alternative-id":["S0166531623000470"],"URL":"https:\/\/doi.org\/10.1016\/j.peva.2023.102377","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[2024,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Performance of the Gittins policy in the G\/G\/1 and G\/G\/k, with and without setup times","name":"articletitle","label":"Article Title"},{"value":"Performance Evaluation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.peva.2023.102377","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"102377"}}