Publisher： Springer Publishing Company
ISSN： 1094-6136
Source： Journal of Scheduling, Vol.9, Iss.1, 2006-02, pp. : 49-62
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
On resource-bounded instance complexity
Theoretical Computer Science, Vol. 161, Iss. 1, 1996-07 ,pp. :
Access to resources
Recommend
Optimum resource determination for project scheduling
Production Planning and Control, Vol. 8, Iss. 5, 1997-07 ,pp. :
Resource bounded randomness and computational complexity
By Wang Y.
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :