The computational complexity of the criticality problems in a network with interval activity times |
| |
| Institution: | 1. School of Science, Hangzhou Dianzi University, Hangzhou, Zhejiang, 310018, P. R. China;2. Department of Mathematics and Statistics, University of South Florida, Tampa, FL, 33620-5700, USA;3. International Institute for Symmetry Analysis and Mathematical Modelling, Department of Mathematical Sciences, North-West University, Mafikeng Campus, Private Bag X2046, Mmabatho 2735, South Africa;4. School of Information Engineering, Hangzhou Dianzi University, Hangzhou, Zhejiang, 310018, P. R. China;5. School of Mathematics and Physical Science, Xuzhou Institute of Technology, Xuzhou, Jiangsu, 221111, P. R. China |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
