期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 136, 期 3, 页码 541-550出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/S0377-2217(01)00048-0
关键词
project management and scheduling; complexity theory; interval criticality; interval CPM
The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) for the case of network with interval activity duration times is given. The computation complexity of five problems linked to the introduced criticality notion is presented. (C) 2002 Elsevier Science B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据