{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T05:35:04Z","timestamp":1771911304393,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Methods of Operations Research"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1007\/bf01194247","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T13:10:10Z","timestamp":1108732210000},"page":"45-62","source":"Crossref","is-referenced-by-count":15,"title":["On computing average cost optimal policies with application to routing to parallel queues"],"prefix":"10.1007","volume":"45","author":[{"given":"Linn I.","family":"Sennott","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1137\/0331018","volume":"31","author":"A Arapostathis","year":"1993","unstructured":"Arapostathis A, Borkar V, Fernandez-Gaucherand E, Ghosh M, Marcus S (1993) Discrete-time controlled Markov processes with average cost criterion: A survey. SIAM J Control Optim 31:282?344","journal-title":"SIAM J Control Optim"},{"key":"CR2","volume-title":"Dynamic programming","author":"D Bertsekas","year":"1987","unstructured":"Bertsekas D (1987) Dynamic programming. Prentice-Hall, Englewood Cliffs New Jersey"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TAC.1980.1102445","volume":"25","author":"A Ephremides","year":"1980","unstructured":"Ephremides A, Varaiya P, Walrand J (1980) A simple dynamic routing problem. IEEE Trans Auto Control 25:690?693","journal-title":"IEEE Trans Auto Control"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1109\/TAC.1984.1103577","volume":"29","author":"B Hajek","year":"1984","unstructured":"Hajek B (1984) Optimal control of two interacting service stations. IEEE Trans Auto Control 29:491?499","journal-title":"IEEE Trans Auto Control"},{"key":"CR5","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov decision processes","author":"M Puterman","year":"1994","unstructured":"Puterman M (1994) Markov decision processes. John Wiley & Sons, New York"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TCOM.1986.1096552","volume":"34","author":"Z Rosberg","year":"1986","unstructured":"Rosberg Z (1986) Deterministic routing to buffered channels. IEEE Trans Comm 34:504?507","journal-title":"IEEE Trans Comm"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.37.4.626","volume":"37","author":"L Sennott","year":"1989","unstructured":"Sennott L (1989) Average cost optimal stationary policies in infinite state Markov decision processes with unbounded costs. Oper Res 37:626?633","journal-title":"Oper Res"},{"key":"CR8","unstructured":"Sennott L (1994) The computation of average optimal policies in denumerable state Markov decision chains. To appear, Adv Appl Prob"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0167-6911(93)E0158-D","volume":"24","author":"L Sennott","year":"1995","unstructured":"Sennott L (1995) Another set of conditions for average optimality in Markov control processes. Sys Control Lett 24:147?151","journal-title":"Sys Control Lett"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01158935","volume":"13","author":"S Stidham Jr.","year":"1993","unstructured":"Stidham S Jr, Weber R (1993) A survey of Markov decision models for control of networks of queues. Queueing Sys 13:291?314","journal-title":"Queueing Sys"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.2307\/3213271","volume":"14","author":"W Winston","year":"1977","unstructured":"Winston W (1977) Optimality of the shortest line discipline. J Appl Prob 14:181?189","journal-title":"J Appl Prob"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"406","DOI":"10.2307\/3213411","volume":"15","author":"R Weber","year":"1978","unstructured":"Weber R (1978) On the optimal assignment of customers to parallel servers. J. Appl Prob 15:406?413","journal-title":"J. Appl Prob"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"1126","DOI":"10.1287\/opre.40.6.1126","volume":"40","author":"S Xu","year":"1992","unstructured":"Xu S, Righter R, Shanthikumar G (1992) Optimal dynamic assignment of customers to heterogeneous servers in parallel. Oper Res 40:1126?1138","journal-title":"Oper Res"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01194247.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01194247\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01194247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T13:09:31Z","timestamp":1556629771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01194247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["BF01194247"],"URL":"https:\/\/doi.org\/10.1007\/bf01194247","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}