A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
This paper addresses the problem of scheduling unit length jobs subject to precedence constraints forming in-and out-stars. There are several different procedures that can be used to solve this problem and our aim in this paper is to compare these procedures empirically. We found that one algorithm that was thought to solve the problem optimally didn't do so for the general set of instances and that all procedures that we tested did not perform well if the number of stars in the instance wasdoi:10.26481/marble.2015.v1.96 fatcat:i6jmffxkyrdbpmppdjzm2el6y4