Assigning chain-like tasks to a chain-like network

Abstract

We investigate the allocation of a chain-like task system consisting of <i>n</i> tasks to a chain-like network of <i>m</i> computers so as to minimize the bottleneck processing cost. We present an <i>&Ogr;</i>(<i>mn</i>) time solution algorithm for this problem. This improves on a sequence of five slower algorithms by Bokhari [1988], Sheu &amp; Chiang [1990], Hsu [1993], and Young &amp; Chan [1993,1994].

Cite this paper

@inproceedings{Woeginger2001AssigningCT, title={Assigning chain-like tasks to a chain-like network}, author={Gerhard J. Woeginger}, booktitle={SODA}, year={2001} }