Using Aggregation to Reduce Response Time Variability in Cyclic Fair Sequences
| dc.contributor.author | Herrmann, Jeffrey W. | |
| dc.date.accessioned | 2008-08-18T14:42:30Z | |
| dc.date.available | 2008-08-18T14:42:30Z | |
| dc.date.issued | 2008-08-15 | |
| dc.description | This work is an extension of “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 | en |
| dc.description.abstract | Fair sequences are useful in a variety of 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 into groups, creates a sequence for those groups, and then disaggregates the sequence into a sequence for each product. Computational experiments show that using aggregation can reduce response time variability dramatically. | en |
| dc.format.extent | 329211 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/8382 | |
| dc.language.iso | en | |
| dc.relation.isAvailableAt | Institute for Systems Research | en_us |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_us |
| dc.relation.isAvailableAt | University of Maryland (College Park, MD) | en_us |
| dc.relation.ispartofseries | TR 2008-20 | |
| dc.subject | scheduling | en |
| dc.subject | fair sequences | en |
| dc.title | Using Aggregation to Reduce Response Time Variability in Cyclic Fair Sequences | en |
| dc.type | Technical Report | en |