Constructing Perfect Aggregations to Eliminate Response Time Variability in Cyclic Fair Sequences

Simple item page
dc.contributor.authorHerrmann, Jeffrey W.
dc.date.accessioned2008-10-20T15:34:32Z
dc.date.available2008-10-20T15:34:32Z
dc.date.issued2008-10
dc.description.abstractFair 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. Previous work introduced an aggregation approach that can reduce response time variability (RTV) dramatically. However, in some cases, aggregating more carefully can generate sequences with zero RTV. We call this a perfect aggregation. This paper discusses properties of instances that have perfect aggregations. Moreover, we present techniques that can find a perfect aggregation if one exists.en
dc.format.extent339904 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/8643
dc.language.isoen_USen
dc.relation.isAvailableAtInstitute for Systems Researchen_us
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_us
dc.relation.isAvailableAtUniversity of Maryland (College Park, MD)en_us
dc.relation.ispartofseriesTR 2008-29en
dc.subjectSchedulingen
dc.subjectfair sequencesen
dc.titleConstructing Perfect Aggregations to Eliminate Response Time Variability in Cyclic Fair Sequencesen
dc.typeTechnical Reporten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Perfect+Aggregation+3.pdf
Size:
331.94 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.81 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Institute for Systems Research Technical Reports