Scheduling identical jobs with chain precedence constraints on two uniform machines

The problem of scheduling identical jobs with chain precedence constraints on two uniform machines is considered. It is shown that the corresponding makespan problem can be solved in linear time. Copyright Springer-Verlag Berlin Heidelberg 1999

MoreLess

Year of publication:	1999
Authors:	Brucker, Peter ; Hurink, Johann ; Kubiak, Wieslaw
Published in:	Computational Statistics. - Springer. - Vol. 49.1999, 2, p. 211-219
Publisher:	Springer
Subject:	Scheduling \| uniform machines \| identical jobs \| chain precedence constraints

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010847645