Proposes a heuristic procedure that constructs a schedule for N unit jobs with arbitrary precedence on identical processors in parallel. Minimization of the total weighted completion times; Application of the proposed heuristic applied to one processor near optimal solutions and the experimental results presented indicate that the heuristic performs equally well.
