Chakrabarti, P. P. (1999) Partial precedence constrained scheduling IEEE Transactions on Computers, 48 (10). pp. 1127-1130. ISSN 0018-9340
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arn...
Related URL: http://dx.doi.org/10.1109/12.805161
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.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronic Engineers. |
| ID Code: | 5980 |
| Deposited On: | 19 Oct 2010 10:00 |
| Last Modified: | 20 May 2011 09:39 |
Repository Staff Only: item control page
