Step in project planning

Scope A bounded description of the data and control, function,

performance, constraints, interfaces and reliability Sufficient to determine project feasibility and create an initial plan.

Scheduling (penjadualan)

Must Managei. Parallelism (tasks can be undertaken

simultaneously) Keselarian (tugas boleh dilaksanakan serentak)

ii. Dependency (task has an effect on subsequent tasks) Kebergantungan (tugas mempunyai kesan kepada tugas

berikutnya)

iii. Bad Scheduling is a very destructive influence (Penjadualan buruk adalah pengaruh yang sangat merosakkan)

iv. Rule 90-90 : First 90% of a project is complete. (Peraturan 90-90 : Pertama 90% projek yang lengkap)

v. 90% of the scheduled time. The other 10% is also completed in 90% of the time (90% daripada masa yang

dijadualkan. Yang lain 10% juga siap dalam 90%)

i. Critical Path (the chain of tasks that determine the duration of the project)

ii. Earliest Time that a task can begin if all preceding tasks are completed in the shortest possible time

iii. Latest Time for task initiation that will not delay the project

iv. Latest and Earliest Finish for the overall project Total Float (the maximum slippage without overall delay)

ADVANTAGE

DISADVANTAGES

A Gantt chart is a type of bar chart, developed by Henry Gantt, that illustrates a project schedule. Gantt charts illustrate the start and finish dates of the terminal elements and summary elements of a project.

Terminal elements and summary elements comprise the work breakdown structure of the project. Some Gantt charts also show the dependency (i.e., precedence network) relationships between activities. Gantt charts can be used to show current schedule status using percent-complete shadings and a vertical.

Activity Predecessor

Time estimates

Expected time

Opt. (O) Normal (M) Pess. (P)

A — 2 4 6 4.00

B — 3 5 9 5.33

C A 4 5 7 5.17

D A 4 6 10 6.33

E B, C 4 5 7 5.17

F D 3 4 8 4.50

G E 3 5 8 5.17

Activity Predecessor

Time estimates

Expected time

Opt. (O) Normal (M) Pess. (P)

A — 2 4 6 4.00

B — 3 5 9 5.33

C A 4 5 7 5.17

D A 4 6 10 6.33

E B, C 4 5 7 5.17

F D 3 4 8 4.50

G E 3 5 8 5.17

The Critical Path Method (CPM) is a mathematically based algorithm for scheduling set of project activities, Project Scheduling.

The name CPM comes from the Critical Path of Activities that determine a project’s minimum duration.

The main outputs of the Critical Path Method are the Arrow Diagram, Activity Schedule, and Modified Bar Chart. Resource Leveling and Crashing are two tools used to optimize projects via scheduling

Example 2

Activity Prior Activity

A None

B A

Activity Prior Activity

A None

B A

C A

Activity Prior Activity

A None

B None

C A, B

D A, B