An optimisation technique for crashing PERT network in project management
Summary: The planning and the subsequent scheduling of a complex project allow us, to identify the duration of the project itself in relation to the assignment costs of the various activities, so as to achieve an acceptable situation of balance between times and costs. This paper presents a method for shortening total project time by determining appropriate activities for crashing in program evaluation review technique (PERT) with a minimum cost. The aim of the study is to crash the pessimistic time in PERT networks by investing the additional amount of money in the activities on the critical path.
- PERT and crashing revisited: Mathematical generalizations
- Optimization of PERT network and compression of time
- scientific article; zbMATH DE number 2076029
- Project crashing in the presence of general non-linear activity time reduction costs
- A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management
- Project crashing in the presence of general non-linear activity time reduction costs
- Comparison of a fuzzy genetic and simulated annealing algorithm approach for project time-cost tradeoff
- PERT and crashing revisited: Mathematical generalizations
- Optimization of PERT network and compression of time
- A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management
- Project management in a competitive environment: interdicting a CPM based project and its implications
- A cost optimizing algorithm in a network plan technique applied to CIMS projects
This page was built for publication: An optimisation technique for crashing PERT network in project management
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545204)
