{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:17:41Z","timestamp":1759335461835},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,8,15]],"date-time":"2009-08-15T00:00:00Z","timestamp":1250294400000},"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":[[2011,2]]},"DOI":"10.1007\/s10951-009-0127-7","type":"journal-article","created":{"date-parts":[[2009,8,14]],"date-time":"2009-08-14T12:29:14Z","timestamp":1250252954000},"page":"39-55","source":"Crossref","is-referenced-by-count":13,"title":["Using aggregation to reduce response time variability in cyclic fair sequences"],"prefix":"10.1007","volume":"14","author":[{"given":"Jeffrey W.","family":"Herrmann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,8,15]]},"reference":[{"key":"127_CR1","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":"127_CR2","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. (2002a). Minimizing service an operation costs of periodic scheduling. Mathematics of Operations Research, 27, 518\u2013544.","journal-title":"Mathematics of Operations Research"},{"key":"127_CR3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s00446-002-0085-1","volume":"15","author":"A. Bar-Noy","year":"2002","unstructured":"Bar-Noy, A., Nisgah, A., & Patt-Shamir, B. (2002b). Nearly optimal perfectly periodic schedules. Distributed Computing, 15, 207\u2013220.","journal-title":"Distributed Computing"},{"key":"127_CR4","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1016\/j.ejor.2003.09.036","volume":"165","author":"A. M. Campbell","year":"2005","unstructured":"Campbell, A. M., & Hardin, J. R. (2005). Vehicle minimization for periodic deliveries. European Journal of Operational Research, 165, 668\u2013684.","journal-title":"European Journal of Operational Research"},{"key":"127_CR5","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":"127_CR6","first-page":"187","volume-title":"Artificial intelligence research and development","author":"A. Garcia","year":"2006","unstructured":"Garcia, A., Pastor, R., & Corominas, A. (2006). Solving the response time variability problem by means of metaheuristics. In M. Polit, T. Talbert, & B. Lopez (Eds.), Artificial intelligence research and development (pp. 187\u2013194). Amsterdam: IOS Press."},{"key":"127_CR7","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. Available online at http:\/\/hdl.handle.net\/1903\/7082 ."},{"key":"127_CR8","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. Available online at http:\/\/hdl.handle.net\/1903\/8643 ."},{"key":"127_CR9","unstructured":"Herrmann, J. W. (2009). Generating cyclic fair sequences for multiple servers. In: Multidisciplinary international conference on scheduling: theory and applications (MISTA 2009), Dublin, Ireland, 10\u201312 August 2009."},{"issue":"7","key":"127_CR10","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1287\/mnsc.37.7.901","volume":"37","author":"R. R. Inman","year":"1991","unstructured":"Inman, R. R., & Bulfin, R. L. (1991). Sequencing JIT mixed-model assembly lines. Management Science, 37(7), 901\u2013904.","journal-title":"Management Science"},{"key":"127_CR11","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. Boca Raton: Chapman & Hall\/CRC."},{"issue":"2","key":"127_CR12","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/mnsc.35.2.192","volume":"35","author":"J. Miltenburg","year":"1989","unstructured":"Miltenburg, J. (1989). Level schedules for mixed-model assembly lines in just-in-time production systems. Management Science, 35(2), 192\u2013207.","journal-title":"Management Science"},{"key":"127_CR13","unstructured":"Moreno, N. (2002). Solving the product rate variation problem (PRVP) of large dimensions as an assignment problem. Doctoral thesis, DOE, UPC."},{"key":"127_CR14","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":"127_CR15","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1287\/opre.33.3.690","volume":"33","author":"K. S. Park","year":"1985","unstructured":"Park, K. S., & Yun, D. K. (1985). Optimal scheduling of periodic activities. Operations Research, 33, 690\u2013695.","journal-title":"Operations Research"},{"key":"127_CR16","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":"127_CR17","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":"6","key":"127_CR18","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1287\/mnsc.39.6.728","volume":"39","author":"G. Steiner","year":"1993","unstructured":"Steiner, G., & Yeomans, S. (1993). Level schedules for mixed-model, just-in-time processes. Management Science, 39(6), 728\u2013735.","journal-title":"Management Science"},{"key":"127_CR19","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":"127_CR20","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"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0127-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0127-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0127-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:43Z","timestamp":1559453983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0127-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,15]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["127"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0127-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,15]]}}}