Using aggregation to reduce response time variability in cyclic fair sequences
- 50 Downloads
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.
KeywordsResponse time variability Fair sequences Aggregation
Unable to display preview. Download preview PDF.
- Balinski, M. L., & Young, H.P. (1982). Fair representation. New Haven: Yale University Press. Google Scholar
- 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–194). Amsterdam: IOS Press. Google Scholar
- 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.
- 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.
- 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–12 August 2009. Google Scholar
- Kubiak, W. (2004). Fair sequences. In J. Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis. Boca Raton: Chapman & Hall/CRC. Google Scholar
- Moreno, N. (2002). Solving the product rate variation problem (PRVP) of large dimensions as an assignment problem. Doctoral thesis, DOE, UPC. Google Scholar
- Rock, H., & Schmidt, G. (1983). Machine aggregation heuristics in shop scheduling. Methods of Operations Research, 45, 303–314. Google Scholar
- 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. Google Scholar