Generating Cyclic Fair Sequences using Aggregation and Stride Scheduling
| dc.contributor.author | Herrmann, Jeffrey W. | |
| dc.date.accessioned | 2007-08-21T13:30:01Z | |
| dc.date.available | 2007-08-21T13:30:01Z | |
| dc.date.issued | 2007 | |
| 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 the problem is known to be NP-hard, we present a heuristic that combines aggregation and parameterized stride scheduling. This novel algorithm 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. | en |
| dc.format.extent | 641309 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/7082 | |
| 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_2007-12 | en |
| dc.subject | fair sequences | en |
| dc.subject | scheduling | en |
| dc.title | Generating Cyclic Fair Sequences using Aggregation and Stride Scheduling | en |
| dc.type | Technical Report | en |