Weiss, Howard J. - In: Management Science 27 (1981) 10, pp. 1209-1216
We present a greedy heuristic for the n job/1 machine scheduling problem with precedence constraints. This method is useful whenever the manager's optimization criteria is the sum of weighted or unweighted completion times, the sum of weighted or unweighted flow times, (with or without release...