Issue No. 10 - October (1999 vol. 48)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.805161
<p><b>Abstract</b>—This paper presents a generalized formulation of precedence constrained scheduling where the number of dependent tasks which are to be scheduled before the task itself can be scheduled is a variable. This formulation is capable of modeling a number of scheduling and path-finding problems. An algorithm is presented to solve the problem of finding the minimum time schedule. Variants are discussed. One simple variant is shown to be NP-Complete.</p>
Scheduling, precedence constraints, shortest-path algorithms, NP-completeness.
P. Chakrabarti, "Partial Precedence Constrained Scheduling," in IEEE Transactions on Computers, vol. 48, no. , pp. 1127-1130, 1999.