{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T06:02:36Z","timestamp":1750485756095},"reference-count":6,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1992,11,1]],"date-time":"1992-11-01T00:00:00Z","timestamp":720576000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1992,11]]},"DOI":"10.1016\/0167-6377(92)90091-g","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"313-319","source":"Crossref","is-referenced-by-count":23,"title":["Algorithms for generalized round robin routing"],"prefix":"10.1016","volume":"12","author":[{"given":"Yair","family":"Arian","sequence":"first","affiliation":[]},{"given":"Yonatan","family":"Levy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90091-G_BIB1","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1145\/2157.322409","article-title":"The proof of a folk theorem on queueing delay with applications to routing in networks","volume":"30","author":"Hajek","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0167-6377(92)90091-G_BIB2","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/moor.10.4.543","article-title":"External splittings of point processes","volume":"10","author":"Hajek","year":"1985","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0167-6377(92)90091-G_BIB3","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TAC.1984.1103619","article-title":"A golden ratio control policy for a multi-access channel","volume":"29","author":"Itai","year":"1984","journal-title":"IEEE Trans. Automat. Control"},{"key":"10.1016\/0167-6377(92)90091-G_BIB4","series-title":"Proc. of Symp. on Congestion Theory","first-page":"137","article-title":"The heavy traffic approximation in the theory of queues","author":"Kingman","year":"1965"},{"key":"10.1016\/0167-6377(92)90091-G_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/15326349108807174","article-title":"New results on the single server queue with a batch Markovian arrival process","volume":"7\/1","author":"Lucantoni","year":"1991","journal-title":"Stochastic Models"},{"key":"10.1016\/0167-6377(92)90091-G_BIB6","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TCOM.1986.1096552","article-title":"Deterministic routing to buffered channels","volume":"34","author":"Rosberg","year":"1986","journal-title":"IEEE Trans. Commun."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290091G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779290091G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:51:01Z","timestamp":1552902661000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779290091G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,11]]},"references-count":6,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,11]]}},"alternative-id":["016763779290091G"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90091-g","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,11]]}}}