Citation
Generating Cyclic Fair Sequences for Multiple Servers. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 628-644, 2009.
Paper
Abstract
Fair sequences allocate capacity to competing demands in a variety of manufacturing and computer systems. This paper considers the generation of cyclic fair sequences for a set of servers that must process a given set of products, each of which must be produced multiple times in each cycle. The objective is to create a sequence that minimizes, for each product, the variability of the time between consecutive completions (the response time). 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 computational effort and response time variability dramatically.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2009-628-644-P, author = {J. W. Herrmann},
title = {Generating Cyclic Fair Sequences for Multiple Servers},
booktitle = {Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland},
year = {2009},
editor = {J. Blazewicz and M. Drozdowski and G. Kendall and B. McCollum},
pages = {628--644},
note = {Paper},
abstract = {Fair sequences allocate capacity to competing demands in a variety of manufacturing and computer systems. This paper considers the generation of cyclic fair sequences for a set of servers that must process a given set of products, each of which must be produced multiple times in each cycle. The objective is to create a sequence that minimizes, for each product, the variability of the time between consecutive completions (the response time). 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 computational effort and response time variability dramatically.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-628-644-P.pdf} }