{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T13:12:49Z","timestamp":1690377169801},"reference-count":8,"publisher":"Cambridge University Press (CUP)","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Appl. Probab."],"published-print":{"date-parts":[[2014,9]]},"abstract":"<jats:p>We consider a multiple server queueing loss system where the service times of server <jats:italic>i<\/jats:italic> are exponential with rate \u03bc<jats:sub>\n                  <jats:italic>i<\/jats:italic>\n               <\/jats:sub>, where \u03bc<jats:sub>\n                  <jats:italic>i<\/jats:italic>\n               <\/jats:sub> decreases in <jats:italic>i<\/jats:italic>. Arrivals have associated vectors (<jats:italic>X<\/jats:italic>\n               <jats:sub>1<\/jats:sub>, \u2026, <jats:italic>X<\/jats:italic>\n               <jats:sub>\n                  <jats:italic>n<\/jats:italic>\n               <\/jats:sub>) of binary variables, with <jats:italic>X<\/jats:italic>\n               <jats:sub>\n                  <jats:italic>i<\/jats:italic>\n               <\/jats:sub> = 1 indicating that server <jats:italic>i<\/jats:italic>\nis eligible to serve that arrival. Arrivals finding no idle eligible servers are lost. Letting <jats:italic>I<\/jats:italic>\n               <jats:sub>\n                  <jats:italic>j<\/jats:italic>\n               <\/jats:sub> be the indicator variable for the event that the <jats:italic>j<\/jats:italic>th arrival enters service, we show that, for any arrival process, the policy that assigns arrivals to the smallest numbered idle eligible server stochastically maximizes the vector (<jats:italic>I<\/jats:italic>\n               <jats:sub>1<\/jats:sub>, \u2026, <jats:italic>I<\/jats:italic>\n               <jats:sub>\n                  <jats:italic>r<\/jats:italic>\n               <\/jats:sub>) for every <jats:italic>r<\/jats:italic> if the eligibility vector of arrivals is either (a) exchangeable, or (b) a vector of independent variables for which <jats:bold>P<\/jats:bold>(<jats:italic>X<\/jats:italic>\n               <jats:sub>\n                  <jats:italic>i<\/jats:italic>\n               <\/jats:sub> = 1) increases in <jats:italic>i<\/jats:italic>.<\/jats:p>","DOI":"10.1017\/s0021900200011736","type":"journal-article","created":{"date-parts":[[2016,3,29]],"date-time":"2016-03-29T14:50:00Z","timestamp":1459263000000},"page":"880-884","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Server Selection in a Queueing Loss Model with Heterogeneous Exponential Servers, Discriminating Arrivals, and Arbitrary Arrival Times"],"prefix":"10.1017","volume":"51","author":[{"given":"Sheldon M.","family":"Ross","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2016,2,19]]},"reference":[{"key":"S0021900200011736_ref3","first-page":"1","volume":"13","year":"1975","journal-title":"Internat. J. Production Res"},{"key":"S0021900200011736_ref2","doi-asserted-by":"publisher","DOI":"10.2307\/3213050"},{"key":"S0021900200011736_ref1","first-page":"69","volume":"13","year":"1976","journal-title":"Opsearch"},{"key":"S0021900200011736_ref4","doi-asserted-by":"publisher","DOI":"10.1017\/S0269964800002692"},{"key":"S0021900200011736_ref7","doi-asserted-by":"publisher","DOI":"10.2307\/3214552"},{"key":"S0021900200011736_ref6","doi-asserted-by":"publisher","DOI":"10.1080\/05695557708975145"},{"key":"S0021900200011736_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(85)90008-2"},{"key":"S0021900200011736_ref8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.5.759"}],"container-title":["Journal of Applied Probability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0021900200011736","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T09:14:12Z","timestamp":1682500452000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0021900200011736\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":8,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["S0021900200011736"],"URL":"https:\/\/doi.org\/10.1017\/s0021900200011736","relation":{},"ISSN":["0021-9002","1475-6072"],"issn-type":[{"value":"0021-9002","type":"print"},{"value":"1475-6072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9]]}}}