Project Management: Analysis of a 63-Variable Network (PMN601)

This assignment explores project management principles through the analysis of a 63-node network, as described by Sonmez & Bettemir (2012). The solution involves scheduling the network using MS Project, calculating costs for shortest and longest project durations, and evaluating the optimization process using a Hybrid Algorithm (HA) which includes Genetic Algorithms (GAs), Simulated Annealing (SA), and Quantum Simulated Annealing (QSA). The assignment delves into schedule compression methods like crashing and fast-tracking, examining their data requirements, technical aspects, potential implementation issues, and associated risks. Furthermore, it discusses scheduling approaches with and without resource constraints, exploring how resources are incorporated, defining resource-constrained scheduling and resource leveling, and identifying issues in applying these principles to real-world projects. The document also references several sources to support its analysis and provides a structured overview of resource leveling, including its stages, phases, and tasks.