|
|||||
|
|
On the hardness of evaluating criticality of activities in a planar network with duration intervals |
|
| Authors: | Stefan Chanas Pawe? Zieliński |
| Affiliation: | a Institute of Industrial Engineering and Management, Wroc?aw University of Technology, Wybrze?e Wyspiańskiego 27, 50-370 Wroc?aw, Poland b Institute of Mathematics, Technical University of Opole, Luboszycka 3, 45-036 Opole, Poland |
| Abstract: | Complexity results for problems of evaluating the criticality of activities in planar networks with duration time intervals are presented. We show that the problems of asserting whether an activity is possibly critical, and of computing bounds on the float of an activity in these networks are NP-complete and NP-hard, respectively. |
| Keywords: | Project management and scheduling Complexity Data intervals |
| 本文献已被 ScienceDirect 等数据库收录！ | |