ITPM Self Study How To Identify Critical Path Using ADM AOA
ITPM Self Study How To Identify Critical Path Using ADM AOA
ITPM/ISPM – September 2023 © 2023 UNIVERSITI TEKNOLOGI PETRONAS. All rights reserved. No part of this document may be reproduced, stored in a retrieval system or transmitted in any
By Norshakirah & Hafizul Abdullah form or by any means (electronic, mechanical, photocopying, recording or otherwise) without the permission of the copyright owner.
Contents Outline
ITPM/ISPM – September 2023 © 2023 UNIVERSITI TEKNOLOGI PETRONAS. All rights reserved. No part of this document may be reproduced, stored in a retrieval system or transmitted in any 2
By Norshakirah & Hafizul Abdullah form or by any means (electronic, mechanical, photocopying, recording or otherwise) without the permission of the copyright owner.
Objectives
ITPM/ISPM – September 2023 © 2023 UNIVERSITI TEKNOLOGI PETRONAS. All rights reserved. No part of this document may be reproduced, stored in a retrieval system or transmitted in any 3
By Norshakirah & Hafizul Abdullah form or by any means (electronic, mechanical, photocopying, recording or otherwise) without the permission of the copyright owner.
The basics
Definition & Components
• CPM is a procedural method to schedule a set of project activities.
• CPM components: Set of activities, Duration for each activity, Interdependencies among activities
Key elements
• Early Finish = Early Start + Duration
• Late Finish = Late Start + Duration
• Float = Late Start – Early Start
• Non critical paths = sub-critical path
Calculations
• Critical Path: The path with longest duration
• Critical path = The earliest and latest start and finish of every activity without delaying the overall project
• The float time: Amount of time an activity can be delayed without causing delay to subsequent task and project
completion date (total float).
ITPM/ISPM – September 2023 © 2023 UNIVERSITI TEKNOLOGI PETRONAS. All rights reserved. No part of this document may be reproduced, stored in a retrieval system or transmitted in any 4
By Norshakirah & Hafizul Abdullah form or by any means (electronic, mechanical, photocopying, recording or otherwise) without the permission of the copyright owner.
Create a network diagram >
Example question Follow these steps!
Outline:
Node Name Predecessor Dur. (Days)
• Create a network
diagram START
• Paths available • Create a network
diagram using ADM
A - 3
• Find critical path • Find critical path B - 5
C A 2
D C 3
E D 3
F C 4
G F,H 7
H B 2
END G,E
ITPM/ISPM – September 2023 © 2023 UNIVERSITI TEKNOLOGI PETRONAS. All rights reserved. No part of this document may be reproduced, stored in a retrieval system or transmitted in any 5
By Norshakirah & Hafizul Abdullah form or by any means (electronic, mechanical, photocopying, recording or otherwise) without the permission of the copyright owner.
Assign a calendar to tasks >
Example question Follow these steps!
Outline:
C,2 D,3
• Create a network
diagram
A,3 E,3
• Paths available
F,4
• Find critical path START END
G,7
B,5 H,2
ITPM/ISPM – September 2023 © 2023 UNIVERSITI TEKNOLOGI PETRONAS. All rights reserved. No part of this document may be reproduced, stored in a retrieval system or transmitted in any 6
By Norshakirah & Hafizul Abdullah form or by any means (electronic, mechanical, photocopying, recording or otherwise) without the permission of the copyright owner.
Create a network diagram >
Creating network diagram Follow these steps!
Outline:
C,2 D,3
• Create a network
diagram
A,3 E,3
• Paths available
F,4
• Find critical path START END
G,7
B,5 H,2
ITPM/ISPM – September 2023 © 2023 UNIVERSITI TEKNOLOGI PETRONAS. All rights reserved. No part of this document may be reproduced, stored in a retrieval system or transmitted in any 7
By Norshakirah & Hafizul Abdullah form or by any means (electronic, mechanical, photocopying, recording or otherwise) without the permission of the copyright owner.
Create a network diagram >
ADM Forward Pass Calculation Follow these steps!
Forward pass: Specify the minimum dates at which each activity can be performed and, ultimately, the minimum duration of a project.
Outline:
3 C,2 5 D,3 8
• Create a network
diagram
A,3 E,3
• Paths available
0 F,4 16
• Find critical path START END
G,7
9
H,2
B,5 5
Node Name Predecessor Dur. (Days)
START
A - 3
B - 5
C A 2
D C 3
E D 3
F C 4
G F,H 7
H B 2
END G,E
ITPM/ISPM – September 2023 © 2023 UNIVERSITI TEKNOLOGI PETRONAS. All rights reserved. No part of this document may be reproduced, stored in a retrieval system or transmitted in any 8
By Norshakirah & Hafizul Abdullah form or by any means (electronic, mechanical, photocopying, recording or otherwise) without the permission of the copyright owner.
Create a network diagram >
ADM Backward Pass Calculation Follow these steps!
Backward pass: Determine the latest dates by which each activity can be performed without increasing the projects minimum duration.
Outline:
3 3 C,2 5 5 D,3 8 13
• Create a network
diagram
A,3 E,3
• Paths available
0 0 F,4 16 16
• Find critical path START END
G,7
9 9
H,2
B,5 5 7
Node Name Predecessor Dur. (Days)
START
A - 3
B - 5
C A 2
D C 3
E D 3
F C 4
G F,H 7
H B 2
END G,E
ITPM/ISPM – September 2023 © 2023 UNIVERSITI TEKNOLOGI PETRONAS. All rights reserved. No part of this document may be reproduced, stored in a retrieval system or transmitted in any 9
By Norshakirah & Hafizul Abdullah form or by any means (electronic, mechanical, photocopying, recording or otherwise) without the permission of the copyright owner.
Create a network diagram >
ADM Float Calculation Follow these steps!
Float: Total float is the amount of time that an activity can be delayed without delaying the project completion date. Float = Finish Date - Start Date.
Outline:
3 3 C,2 5 5 D,3 8 13
• Create a network
diagram 0 0 5
A,3 E,3
• Paths available
0 0 F,4 16 16
• Find critical path START END
0 G,7 0
9 9
H,2
B,5 5 7 0
2 Node Name Predecessor Dur. (Days)
START
A - 3
B - 5
C A 2
D C 3
E D 3
F C 4
G F,H 7
H B 2
END G,E
ITPM/ISPM – September 2023 © 2023 UNIVERSITI TEKNOLOGI PETRONAS. All rights reserved. No part of this document may be reproduced, stored in a retrieval system or transmitted in any 10
By Norshakirah & Hafizul Abdullah form or by any means (electronic, mechanical, photocopying, recording or otherwise) without the permission of the copyright owner.
Paths available >
How many paths and duration? Follow these steps!
Float: Total float is the amount of time that an activity can be delayed without delaying the project completion date. Float = Finish Date - Start Date.
Outline:
3 3 C,2 5 5 D,3 8 13
• Create a network
diagram 0 0 5
A,3 E,3
• Paths available
0 0 F,4 16 16
• Find critical path START END
0 G,7 0
9 9
H,2
B,5 5 7 0
2 Node Name Predecessor Dur. (Days)
START
A - 3
B - 5
C A 2
D C 3
Path 1: Start-A-C-D-E-End = ? Days E D 3
Path 2: Start-A-C-F-G-End = ? Days F C 4
G F,H 7
Path 3: Start-B-H-G-End = ? Days
H B 2
END G,E
ITPM/ISPM – September 2023 © 2023 UNIVERSITI TEKNOLOGI PETRONAS. All rights reserved. No part of this document may be reproduced, stored in a retrieval system or transmitted in any 11
By Norshakirah & Hafizul Abdullah form or by any means (electronic, mechanical, photocopying, recording or otherwise) without the permission of the copyright owner.
Paths available >
How many paths and duration? Follow these steps!
Float: Total float is the amount of time that an activity can be delayed without delaying the project completion date. Float = Finish Date - Start Date.
Outline:
3 3 C,2 5 5 D,3 8 13
• Create a network
diagram 0 0 5
A,3 E,3
• Paths available
0 0 F,4 16 16
• Find critical path START END
0 G,7 0
9 9
H,2
B,5 5 7 0
2 Node Name Predecessor Dur. (Days)
START
A - 3
B - 5
C A 2
D C 3
Path 1: Start-A-C-D-E-End = ? Days E D 3
Path 2: Start-A-C-F-G-End = ? Days F C 4
G F,H 7
Path 3: Start-B-H-G-End = ? Days
H B 2
END G,E
ITPM/ISPM – September 2023 © 2023 UNIVERSITI TEKNOLOGI PETRONAS. All rights reserved. No part of this document may be reproduced, stored in a retrieval system or transmitted in any 12
By Norshakirah & Hafizul Abdullah form or by any means (electronic, mechanical, photocopying, recording or otherwise) without the permission of the copyright owner.
Find critical path >
Determining Critical Path Follow these steps!
Critical Path: The critical path is the longest path in the network diagram. It has float =0.
Outline:
3 3 C,2 5 5 D,3 8 13
• Create a network
diagram 0 0 5
A,3 E,3
• Paths available
0 0 F,4 16 16
• Find critical path START END
0 G,7 0
9 9
H,2
B,5 5 7 0
2 Node Name Predecessor Dur. (Days)
START
A - 3
B - 5
C A 2
D C 3
E D 3
F C 4
G F,H 7
H B 2
END G,E
ITPM/ISPM – September 2023 © 2023 UNIVERSITI TEKNOLOGI PETRONAS. All rights reserved. No part of this document may be reproduced, stored in a retrieval system or transmitted in any 13
By Norshakirah & Hafizul Abdullah form or by any means (electronic, mechanical, photocopying, recording or otherwise) without the permission of the copyright owner.
You have completed lesson for Lab 3…
Any questions?
ITPM/ISPM – September 2023 © 2023 UNIVERSITI TEKNOLOGI PETRONAS. All rights reserved. No part of this document may be reproduced, stored in a retrieval system or transmitted in any 14
By Norshakirah & Hafizul Abdullah form or by any means (electronic, mechanical, photocopying, recording or otherwise) without the permission of the copyright owner.
INSTRUCTIONS
Submission: INDIVIDUAL SUBMISSION
File type: PDF file (.pdf)
File name: matricNumber-Lab3.pdf
example: 20002199-Lab3.pdf
ITPM/ISPM – September 2023 © 2023 UNIVERSITI TEKNOLOGI PETRONAS. All rights reserved. No part of this document may be reproduced, stored in a retrieval system or transmitted in any 15
By Norshakirah & Hafizul Abdullah form or by any means (electronic, mechanical, photocopying, recording or otherwise) without the permission of the copyright owner.
THANK YOU
Scan the QR Code or
go to
https://bit.ly/GetConnected2UTP
ITPM/ISPM – September 2023 © 2023 UNIVERSITI TEKNOLOGI PETRONAS. All rights reserved. No part of this document may be reproduced, stored in a retrieval system or transmitted in any 16
By Norshakirah & Hafizul Abdullah form or by any means (electronic, mechanical, photocopying, recording or otherwise) without the permission of the copyright owner.