.png){kind=icon}
Return
Partial precedence constrained scheduling
.png){kind=icon}
PRE
AI
DOI：10.1109/12.805161.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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:
scheduling
precedence constraints
shortest-path algorithms
NP-completeness
Journal
IF:
3.8
Papers:
5.3K
Citations:
9.8K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave no more
no more