{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:10:52Z","timestamp":1758845452288,"version":"3.41.0"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2006,12]]},"abstract":"<jats:p>\n            We consider a fundamental scheduling problem in a multiserver stochastic network consisting of 2 classes of customers and 2 classes of servers. Customers of class\n            <jats:italic>k<\/jats:italic>\n            arrive to queue\n            <jats:italic>k<\/jats:italic>\n            according to a Poisson process with rate \u03bb\n            <jats:italic>\n              <jats:sub>k<\/jats:sub>\n              , k\n            <\/jats:italic>\n            = 1, 2. The service times of class\n            <jats:italic>k<\/jats:italic>\n            customers at class \u2113 servers are i.i.d. following an exponential distribution with mean \u03bc\n            <jats:sub>\n              <jats:italic>k<\/jats:italic>\n              \u2113\n            <\/jats:sub>\n            <jats:sup>-1<\/jats:sup>\n            , \u2200\n            <jats:italic>k<\/jats:italic>\n            , \u2113 = 1, 2, where 0 &lt; \u03bc\n            <jats:sub>11<\/jats:sub>\n            , \u03bc\n            <jats:sub>12<\/jats:sub>\n            , \u03bc\n            <jats:sub>22<\/jats:sub>\n            &lt; \u221e and \u03bc\n            <jats:sub>21<\/jats:sub>\n            = 0. Hence, class 1 customers can be served at both classes of servers, but class 2 customers can only be served at class 2 servers. A FCFS queueing discipline is employed at each queue. The customer arrival and service processes are mutually independent of each other and of all resource allocation decisions.\n          <\/jats:p>","DOI":"10.1145\/1215956.1215974","type":"journal-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T19:52:18Z","timestamp":1175802738000},"page":"45-47","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimal scheduling in a multiserver stochastic network"],"prefix":"10.1145","volume":"34","author":[{"given":"Mohsen","family":"Bayati","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mayank","family":"Sharma","sequence":"additional","affiliation":[{"name":"IBM Thomas J. Watson Research Center, Yorktown Heights, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark S.","family":"Squillante","sequence":"additional","affiliation":[{"name":"IBM Thomas J. Watson Research Center, Yorktown Heights, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,12]]},"reference":[{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1015345343"},{"key":"e_1_2_1_3_1","unstructured":"D. P. Bertsekas. Dynamic Programming and Optimal Control Volume II. Athena Scientific 2nd edition 2001.   D. P. Bertsekas. Dynamic Programming and Optimal Control Volume II. Athena Scientific 2nd edition 2001."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/msom.5.2.79.16071"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.207589"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/107971.107987"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2001.946370"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1215956.1215974","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1215956.1215974","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:16Z","timestamp":1750278136000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1215956.1215974"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["10.1145\/1215956.1215974"],"URL":"https:\/\/doi.org\/10.1145\/1215956.1215974","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2006,12]]},"assertion":[{"value":"2006-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}