0% found this document useful (0 votes)
246 views5 pages

Hospital Management System

The document discusses the critical path method (CPM) for project scheduling. It provides definitions for key CPM terms like critical path, critical activities, earliest start/finish times, latest start/finish times, and float. It then shows an example CPM calculation for a project with multiple tasks, identifying the critical path and calculating earliest start/finish times, latest start/finish times, and float for each task.

Uploaded by

Tejas Jamdade
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
246 views5 pages

Hospital Management System

The document discusses the critical path method (CPM) for project scheduling. It provides definitions for key CPM terms like critical path, critical activities, earliest start/finish times, latest start/finish times, and float. It then shows an example CPM calculation for a project with multiple tasks, identifying the critical path and calculating earliest start/finish times, latest start/finish times, and float for each task.

Uploaded by

Tejas Jamdade
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Hospital Management System: Gantt chart

0 Task 1 Task 2 Task 3 Task 4 Task 5 Task 6 Task 7 Task 8 Task 9 Task 10 Task 11 5 10

Weeks

15

20

25

30

CPM: Path A connected sequence of activities leading from the starting event to the ending event

Critical Path The longest path (time); determines the project duration

Critical Activities All of the activities that make up the critical path

Forward Pass Earliest Start Time (ES) earliest time an activity can start ES = maximum EF of immediate predecessors

Earliest finish time (EF) earliest time an activity can finish

EF= ES + t Backward Pass 

earliest start time plus activity time

Latest Start Time (LS)

Latest time an activity can start without delaying critical path time LS= LF - t  Latest finish time (LF)

latest time an activity can be completed without delaying critical path time LS = minimum LS of immediate predecessors

CPM Calculation

f, 15 a, 6 h, 9 g, 17 i, 6 b, 8 d, 13

c, 5

e, 9

j, 12

ES and EF Times 6 f, 15 a, 6 0 6 b, 8 0 0 c, 5 5 5 14 e, 9 8 8 21 d, 13 21 33 j, 12 Earlier Finish Time (EF)=33 6 23 i, 6 23 29 20 23 g, 17 h, 9 21

LS and LF Times

f, 15

6 21 18 24

h, 9 21 30 24 33

a, 6 0 4 6 10 b, 8 0 0 c, 5 0 7 5 12 8 8 d, 13 8 8 21 21 23 29 27 33 21 21 33 33 g, 17 6 23 18 27 i, 6

j, 12

5 14 12 21 e, 9

Float a, 6 0 3 4 6 10 b, 8 0 0 0 c, 5 0 7 7 5 12 8 8

f, 15 3

6 21 18 24

h, 9 21 30 3 24 33

g, 17

6 23 18 27 i, 6

d, 13 8 0 8 21 21

4 23 29 27 33 0 21 21 33 33

j, 12

5 14 7 12 21 e, 9

Critical Path f, 15 a, 6 h, 9 g, 17 i, 6 b, 8 d, 13

c, 5

e, 9

j, 12

You might also like