{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:06Z","timestamp":1725544746300},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_38","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T11:50:30Z","timestamp":1140177030000},"page":"398-409","source":"Crossref","is-referenced-by-count":1,"title":["Maximizing Throughput in Queueing Networks with Limited Flexibility"],"prefix":"10.1007","author":[{"given":"Douglas G.","family":"Down","sequence":"first","affiliation":[]},{"given":"George","family":"Karakostas","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1287\/opre.1040.0200","volume":"53","author":"S. Andrad\u00f3ttir","year":"2005","unstructured":"Andrad\u00f3ttir, S., Ayhan, H.: Throughput maximization for tandem lines with two stations and flexible servers. Operations Research\u00a053, 516\u2013531 (2005)","journal-title":"Operations Research"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1287\/mnsc.47.10.1421.10262","volume":"47","author":"S. Andrad\u00f3ttir","year":"2001","unstructured":"Andrad\u00f3ttir, S., Ayhan, H., Down, D.G.: Server assignment policies for maximizing the steady-state throughput of finite queueing systems. Management Science\u00a047, 1421\u20131439 (2001)","journal-title":"Management Science"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"952","DOI":"10.1287\/opre.51.6.952.24913","volume":"51","author":"S. Andrad\u00f3ttir","year":"2003","unstructured":"Andrad\u00f3ttir, S., Ayhan, H., Down, D.G.: Dynamic server allocation for queueing networks with flexible servers. Operations Research\u00a051, 952\u2013968 (2003)","journal-title":"Operations Research"},{"key":"38_CR4","unstructured":"Armony, M., Bambos, N.: Queueing networks with interacting service resources. In: Proceedings of the 37th Annual Allerton Conference on Communications, Control, and Computing, pp. 42\u201351 (1999)"},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-45749-6_13","volume-title":"Algorithms - ESA 2002","author":"G. Baier","year":"2002","unstructured":"Baier, G., K\u00f6hler, E., Skutella, M.: On the k-splittable flow problem. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, p. 101. Springer, Heidelberg (2002)"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1080\/15458830.1996.11770718","volume":"28","author":"D.P. Bischak","year":"1996","unstructured":"Bischak, D.P.: Performance of a manufacturing module with moving workers. IIE Transactions\u00a028, 723\u2013733 (1996)","journal-title":"IIE Transactions"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1214\/aoap\/1177004828","volume":"5","author":"J.G. Dai","year":"1995","unstructured":"Dai, J.G.: On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. Annals of Applied Probability\u00a05, 49\u201377 (1995)","journal-title":"Annals of Applied Probability"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1287\/opre.1040.0170","volume":"53","author":"J.G. Dai","year":"2005","unstructured":"Dai, J.G., Lin, W.: Maximum pressure policies in stochastic processing networks. Operations Research\u00a053, 197\u2013218 (2005)","journal-title":"Operations Research"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s004930050043","volume":"19","author":"Y. Dinitz","year":"1999","unstructured":"Dinitz, Y., Garg, N., Goemans, M.: On the single-source unsplittable flow problem. Combinatorica\u00a019, 17\u201341 (1999)","journal-title":"Combinatorica"},{"key":"38_CR10","volume-title":"Computers and Intractability: a guide to the theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: a guide to the theory of NP-Completeness. W.H. Freeman and Co., New York (1979)"},{"key":"38_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric algorithms and combinatorial optimization, ch. 6","author":"M. Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric algorithms and combinatorial optimization, ch. 6. Springer, Heidelberg (1993)"},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1287\/opre.44.3.435","volume":"44","author":"F.S. Hillier","year":"1996","unstructured":"Hillier, F.S., So, K.C.: On the simultaneous optimization of server and work allocations in production line systems with variable processing times. Operations Research\u00a044, 435\u2013443 (1996)","journal-title":"Operations Research"},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1080\/07408170490487759","volume":"36","author":"W.J. Hopp","year":"2004","unstructured":"Hopp, W.J., van Oyen, M.P.: Agile workforce evaluation: A framework for cross-training and coordination. IIE Transactions\u00a036, 919\u2013940 (2004)","journal-title":"IIE Transactions"},{"key":"38_CR14","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1137\/S0097539799355314","volume":"31","author":"S.G. Kolliopoulos","year":"2002","unstructured":"Kolliopoulos, S.G., Stein, C.: Approximation algorithms for single-source unsplittable flow. SIAM J. Computing\u00a031, 919\u2013946 (2002)","journal-title":"SIAM J. Computing"},{"key":"38_CR15","first-page":"199","volume":"28","author":"A.N. Rybko","year":"1992","unstructured":"Rybko, A.N., Stolyar, A.L.: Ergodicity of stochastic processes describing the operation of open queueing networks. Problems of Information Transmission\u00a028, 199\u2013220 (1992)","journal-title":"Problems of Information Transmission"},{"issue":"3","key":"38_CR16","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D.B. Shmoys","year":"1993","unstructured":"Shmoys, D.B., Tardos: An approximation algorithm for the generalized assignment problem. Mathematical Programming A\u00a062(3), 461\u2013474 (1993)","journal-title":"Mathematical Programming A"},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"Squillante, M.S., Xia, C.H., Yao, D.D., Zhang, L.: Threshold-based priority policies for parallel-server systems with affinity scheduling. In: Proceedings of the 2001 American Control Conference, pp. 2992\u20132999 (2001)","DOI":"10.1109\/ACC.2001.946370"},{"key":"38_CR18","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/15326340008807575","volume":"16","author":"L. Tassiulas","year":"2000","unstructured":"Tassiulas, L., Bhattacharya, P.B.: Allocation of independent resources for maximal throughput. Stochastic Models\u00a016, 27\u201348 (2000)","journal-title":"Stochastic Models"},{"key":"38_CR19","doi-asserted-by":"publisher","first-page":"1936","DOI":"10.1109\/9.182479","volume":"37","author":"L. Tassiulas","year":"1992","unstructured":"Tassiulas, L., Ephrimedes, A.: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control\u00a037, 1936\u20131948 (1992)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"38_CR20","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1287\/mnsc.42.8.1151","volume":"42","author":"E. Zavadlav","year":"1996","unstructured":"Zavadlav, E., McClain, J.O., Thomas, L.J.: Self-buffering, self-balancing, selfflushing production lines. Management Science\u00a042, 1151\u20131164 (1996)","journal-title":"Management Science"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T07:04:05Z","timestamp":1552374245000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11682462_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}