Scribd
Upload
3 views1 page

Project Work

The document outlines a project management optimization solution using the Critical Path Method (CPM) with a project duration of 34 days and a 40-day deadline. It includes a linear programming model to minimize costs associated with in-house labor and hired developers, along with constraints for task scheduling. Additionally, it discusses an emerging trend in AI-based predictive optimization that enhances project efficiency by dynamically adjusting schedules and reducing costs.

Uploaded by

pwanicyber2023
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views1 page

Project Work

The document outlines a project management optimization solution using the Critical Path Method (CPM) with a project duration of 34 days and a 40-day deadline. It includes a linear programming model to minimize costs associated with in-house labor and hired developers, along with constraints for task scheduling. Additionally, it discusses an emerging trend in AI-based predictive optimization that enhances project efficiency by dynamically adjusting schedules and reducing costs.

Uploaded by

pwanicyber2023
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Project Management Optimization – Solution Summary

(a) Critical Path Method (CPM)


Critical Path: A → B → C → D → E
Project Duration: 34 days (6 days slack before 40-day deadline).

Earliest and Latest Start/Finish Times:


A: ES=0, EF=8, LS=6, LF=14
B: ES=8, EF=18, LS=14, LF=24
C: ES=18, EF=25, LS=24, LF=31
D: ES=25, EF=30, LS=31, LF=36
E: ES=30, EF=34, LS=36, LF=40

(b) Linear Programming Model


Decision Variables:
s_i = start time of task i (days)
f_i = s_i + D_i = finish time of task i
h_t = extra hired developers on day t (≥0)

Objective Function:
Minimize Z = Σ(r_i·D_i·c_i) + Σ(C_h·h_t)
(In-house labor + cost of hired developers)

Constraints:
s_B ≥ f_A, s_C ≥ f_B, s_D ≥ f_C, s_E ≥ f_D
f_E ≤ 40 (deadline)
Σ[r_i active on day t] ≤ R + h_t (developer limit)
s_i ≥ 0, h_t ≥ 0

Fixed In-house Cost = $28,320

(c) Emerging Trend in Optimization


AI-based predictive optimization combines machine learning with operations research.
It can estimate task durations, detect risks, and dynamically adjust schedules.
Applying this allows automatic rescheduling or hiring only when needed,
reducing cost while ensuring completion within the 40-day deadline.

You might also like