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 , Sheu & Chiang , Hsu , and Young & Chan [1993,1994].
Unfortunately, ACM prohibits us from displaying non-influential references for this paper.
To see the full reference list, please visit http://dl.acm.org/citation.cfm?id=365774.