{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T13:31:53Z","timestamp":1649079113200},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,11,24]],"date-time":"2010-11-24T00:00:00Z","timestamp":1290556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10951-010-0209-6","type":"journal-article","created":{"date-parts":[[2010,11,23]],"date-time":"2010-11-23T18:26:10Z","timestamp":1290536770000},"page":"181-192","source":"Crossref","is-referenced-by-count":0,"title":["Using aggregation to construct periodic policies for routing jobs to\u00a0parallel servers with deterministic service times"],"prefix":"10.1007","volume":"15","author":[{"given":"Jeffrey W.","family":"Herrmann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,24]]},"reference":[{"issue":"4","key":"209_CR1","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1145\/347476.347482","volume":"47","author":"E. Altman","year":"2000","unstructured":"Altman, E., Gaujal, B., & Hordijk, A. (2000). Balanced sequences and optimal routing. Journal of the ACM, 47(4), 752\u2013775.","journal-title":"Journal of the ACM"},{"key":"209_CR2","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0167-6377(92)90091-G","volume":"12","author":"Y. Arian","year":"1992","unstructured":"Arian, Y., & Levy, Y. (1992). Algorithms for generalized round robin. Operations Research Letters, 12, 313\u2013319.","journal-title":"Operations Research Letters"},{"key":"209_CR3","volume-title":"Fair representation","author":"M. L. Balinski","year":"1982","unstructured":"Balinski, M. L., & Young, H. P. (1982). Fair representation. New Haven: Yale University Press."},{"key":"209_CR4","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/moor.27.3.518.314","volume":"27","author":"A. Bar-Noy","year":"2002","unstructured":"Bar-Noy, A., Bhatia, R., Naor, J., & Schieber, B. (2002). Minimizing service an operation costs of periodic scheduling. Mathematics of Operations Research, 27, 518\u2013544.","journal-title":"Mathematics of Operations Research"},{"key":"209_CR5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(94)90292-5","volume":"125","author":"M. B. Comb\u00e9","year":"1994","unstructured":"Comb\u00e9, M. B., & Boxma, O. J. (1994). Optimization of static traffic allocation policies. Theoretical Computer Science, 125, 17\u201343.","journal-title":"Theoretical Computer Science"},{"key":"209_CR6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10951-006-0002-8","volume":"10","author":"A. Corominas","year":"2007","unstructured":"Corominas, A., Kubiak, W., & Palli, N. M. (2007). Response time variability. Journal of Scheduling, 10, 97\u2013110.","journal-title":"Journal of Scheduling"},{"key":"209_CR7","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/moor.10.4.543","volume":"10","author":"B. Hajek","year":"1985","unstructured":"Hajek, B. (1985). Extremal splittings of point processes. Mathematics of Operations Research, 10, 543\u2013556.","journal-title":"Mathematics of Operations Research"},{"key":"209_CR8","unstructured":"Herrmann, J. W. (2007). Generating cyclic fair sequences using aggregation and stride scheduling (Technical Report 2007-12). Institute for Systems Research, University of Maryland, College Park. http:\/\/hdl.handle.net\/1903\/7082 . Accessed 1 November 2010."},{"key":"209_CR9","unstructured":"Herrmann, J. W. (2008). Constructing perfect aggregations to eliminate response time variability in cyclic fair sequences (Technical Report 2008-29). Institute for Systems Research, University of Maryland, College Park. http:\/\/hdl.handle.net\/1903\/8643 . Accessed 1 November 2010."},{"key":"209_CR10","volume-title":"MISTA 2009","author":"J. W. Herrmann","year":"2009","unstructured":"Herrmann, J. W. (2009a). Generating cyclic fair sequences for multiple servers. In MISTA 2009, Dublin, Ireland, August 10\u201312, 2009."},{"key":"209_CR11","doi-asserted-by":"crossref","unstructured":"Herrmann, J. W. (2009b). Using aggregation to reduce response time variability in cyclic fair sequences. Journal of Scheduling. doi: 10.1007\/s10951-009-0127-7 .","DOI":"10.1007\/s10951-009-0127-7"},{"issue":"2","key":"209_CR12","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1287\/moor.1040.0135","volume":"30","author":"A. Hordijk","year":"2005","unstructured":"Hordijk, A., & van\u00a0der Laan, D. (2005). On the average waiting time for regular routing to deterministic queues. Mathematics of Operations Research, 30(2), 521\u2013544.","journal-title":"Mathematics of Operations Research"},{"key":"209_CR13","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1017\/S0269964800003508","volume":"8","author":"A. Hordijk","year":"1994","unstructured":"Hordijk, A., Koole, G. M., & Loeve, J. A. (1994). Analysis of a customer assignment model with no state information. Probability in the Engineering and Informational Sciences, 8, 419\u2013429.","journal-title":"Probability in the Engineering and Informational Sciences"},{"key":"209_CR14","first-page":"1","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"W. Kubiak","year":"2004","unstructured":"Kubiak, W. (2004). Fair sequences. In J. Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis (pp.\u00a01\u201321). Boca Raton: Chapman & Hall\/CRC Press."},{"key":"209_CR15","volume-title":"Proportional optimization and fairness","author":"W. Kubiak","year":"2009","unstructured":"Kubiak, W. (2009). Proportional optimization and fairness. New York: Springer."},{"key":"209_CR16","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0167-6377(89)90045-X","volume":"8","author":"E. Nowicki","year":"1989","unstructured":"Nowicki, E., & Smutnicki, C. (1989). Worst-case analysis of an approximation algorithm for flow shop scheduling. Operations Research Letters, 8, 171\u2013177.","journal-title":"Operations Research Letters"},{"key":"209_CR17","first-page":"303","volume":"45","author":"H. Rock","year":"1983","unstructured":"Rock, H., & Schmidt, G. (1983). Machine aggregation heuristics in shop scheduling. Methods of Operations Research, 45, 303\u2013314.","journal-title":"Methods of Operations Research"},{"issue":"4","key":"209_CR18","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1287\/opre.39.4.553","volume":"39","author":"D. F. Rogers","year":"1991","unstructured":"Rogers, D. F., Plante, R. D., Wong, R. T., & Evans, J. R. (1991). Aggregation and disaggregation techniques and methodology in optimization. Operations Research, 39(4), 553\u2013582.","journal-title":"Operations Research"},{"issue":"12","key":"209_CR19","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.tcs.2003.11.021","volume":"314","author":"S. Sano","year":"2004","unstructured":"Sano, S., Miyoshi, N., & Kataoka, R. (2004). m-balanced words: a generalization of balanced words. Theoretical Computer Science, 314(12), 97\u2013120.","journal-title":"Theoretical Computer Science"},{"key":"209_CR20","unstructured":"van\u00a0der Laan, D. A. (2000). Routing jobs to servers with deterministic service times (Technical Report 2000-20). Leiden University."},{"key":"209_CR21","unstructured":"van\u00a0der Laan, D. A. (2003). The structure and performance of optimal routing sequences. Ph.D. thesis, Leiden University, Leiden, The Netherlands."},{"issue":"1","key":"209_CR22","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1287\/moor.1040.0131","volume":"30","author":"D. A. Laan van\u00a0der","year":"2005","unstructured":"van\u00a0der Laan, D. A. (2005). Routing jobs to servers with deterministic service times. Mathematics of Operations Research, 30(1), 195\u2013224.","journal-title":"Mathematics of Operations Research"},{"key":"209_CR23","unstructured":"Waldspurger, C. A., & Weihl, W. E. (1995). Stride scheduling: deterministic proportional-share resource management. Technical Memorandum MIT\/LCS\/TM-528, MIT Laboratory for Computer Science, Cambridge, Massachusetts."},{"issue":"2","key":"209_CR24","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0167-6377(83)90044-5","volume":"2","author":"W. D. Wei","year":"1983","unstructured":"Wei, W. D., & Liu, C. L. (1983). On a periodic maintenance problem. Operations Research Letters, 2(2), 90\u201393.","journal-title":"Operations Research Letters"},{"key":"209_CR25","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1109\/TCOM.1981.1095011","volume":"29","author":"T. P. Yum","year":"1981","unstructured":"Yum, T. P. (1981). The design and analysis of a semi-dynamic deterministic routing rule. IEEE Transactions on Communications, 29, 498\u2013504.","journal-title":"IEEE Transactions on Communications"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0209-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0209-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0209-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T13:36:42Z","timestamp":1559828202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0209-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,24]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["209"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0209-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,24]]}}}