{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:49Z","timestamp":1750307749257,"version":"3.41.0"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"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":[[2007,9]]},"abstract":"<jats:p>A large number of application areas involve resource allocation problems in which resources of different capabilities are used to provide service to various classes of customers at their arrival instants, otherwise the opportunity to serve the customer is lost. Stochastic loss networks are often used to capture the dynamics and uncertainty of this class of resource allocation problems. A wide variety of examples include applications in telephony and data networks, distributed computing and data centers, inventory control and manufacturing systems, and call and contact centers. Another emerging application area is workforce management where, e.g., an IT services company offers a collection of service products, each requiring a set of resources with certain capabilities. The customer demands for such IT service products are stochastic and the IT services company seeks to determine its per-class resource capacity levels in order to maximize its profits over the long run.<\/jats:p>","DOI":"10.1145\/1330555.1330571","type":"journal-article","created":{"date-parts":[[2008,1,18]],"date-time":"2008-01-18T18:45:29Z","timestamp":1200681929000},"page":"39-41","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Optimal capacity planning in stochastic loss networks"],"prefix":"10.1145","volume":"35","author":[{"given":"Yingdong","family":"Lu","sequence":"first","affiliation":[{"name":"IBM Thomas J. Watson Research Center, Yorktown Heights, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana","family":"Radovanovi\u0107","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":[[2007,9]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"Bazaraa M.","year":"1993","unstructured":"M. Bazaraa , H. Sherali , C. Shetty . Nonlinear Programming: Theory and Algorithms . John Wiley , Second edition, 1993 . M. Bazaraa, H. Sherali, C. Shetty. Nonlinear Programming: Theory and Algorithms. John Wiley, Second edition, 1993."},{"issue":"7","key":"e_1_2_1_2_1","first-page":"1283","article-title":"Methods in traffic calculations","volume":"63","author":"Jagerman D.","year":"1984","unstructured":"D. Jagerman . Methods in traffic calculations . AT&T Bell Lab. Tech. Journal , 63 ( 7 ): 1283 -- 1310 , 1984 . D. Jagerman. Methods in traffic calculations. AT&T Bell Lab. Tech. Journal, 63(7):1283--1310, 1984.","journal-title":"Journal"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.2307\/1427309"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.2307\/1427273"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2307\/3214550"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.2307\/1426738"},{"issue":"8","key":"e_1_2_1_7_1","first-page":"1807","article-title":"Blocking when service is required from several facilities simultaneously","volume":"64","author":"Whitt W.","year":"1985","unstructured":"W. Whitt . Blocking when service is required from several facilities simultaneously . AT&T Bell Lab. Tech. Journal , 64 ( 8 ): 1807 -- 1856 , 1985 . W. Whitt. Blocking when service is required from several facilities simultaneously. AT&T Bell Lab. Tech. Journal, 64(8):1807--1856, 1985.","journal-title":"Journal"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","unstructured":"W. Whitt. Stochastic-Process Limits. Springer-Verlag 2002.  W. Whitt. Stochastic-Process Limits . Springer-Verlag 2002.","DOI":"10.1007\/b97479"}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1330555.1330571","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1330555.1330571","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:39:12Z","timestamp":1750253952000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1330555.1330571"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["10.1145\/1330555.1330571"],"URL":"https:\/\/doi.org\/10.1145\/1330555.1330571","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2007,9]]},"assertion":[{"value":"2007-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}