caa a22 4500 445838426 CHVBK 20180317145336.0 cr unu---uuuuu 170323e20110201xx s 000 0 eng 10.1007/s10951-009-0127-7 doi (NATIONALLICENCE)springer-10.1007/s10951-009-0127-7 Herrmann Jeffrey Department of Mechanical Engineering, University of Maryland, 2181 Martin Hall, 20742, College Park, MD, USA aut Using aggregation to reduce response time variability in cyclic fair sequences [Elektronische Daten] [Jeffrey Herrmann] Fair sequences are useful in a variety of applications, including manufacturing and computer systems. This paper considers the generation of cyclic fair sequences for a given set of products, each of which must be produced multiple times in each cycle. The objective is to create a sequence so that, for each product, the variability of the time between consecutive completions is minimized. Because minimizing response time variability is known to be NP-hard and the performance of existing heuristics is poor for certain classes of problems, we present an aggregation approach that combines products with the same demand, creates a sequence for the aggregated instance, and then disaggregates this solution into a feasible sequence for the original instance. Computational experiments show that using aggregation can reduce response time variability dramatically and also reduces computational effort. Springer Science+Business Media, LLC, 2009 Response time variability nationallicence Fair sequences nationallicence Aggregation nationallicence Journal of Scheduling Springer US; http://www.springer-ny.com 14/1(2011-02-01), 39-55 1094-6136 14:1<39 2011 14 10951 https://doi.org/10.1007/s10951-009-0127-7 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s10951-009-0127-7 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Herrmann Jeffrey Department of Mechanical Engineering, University of Maryland, 2181 Martin Hall, 20742, College Park, MD, USA aut NATIONALLICENCE 773 0- Journal of Scheduling Springer US; http://www.springer-ny.com 14/1(2011-02-01), 39-55 1094-6136 14:1<39 2011 14 10951 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer