Title :
Partial precedence constrained scheduling
Author :
Chakrabarti, P.P.
Author_Institution :
Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur, India
fDate :
10/1/1999 12:00:00 AM
Abstract :
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
Keywords :
computational complexity; constraint handling; scheduling; NP-Complete; dependent tasks; precedence constrained scheduling; shortest-path algorithms; Constraint optimization; Costs; Personal communication networks; Problem-solving; Processor scheduling; Scheduling algorithm;
Journal_Title :
Computers, IEEE Transactions on
