Part - Three Maintenance Planning
Part - Three Maintenance Planning
Part - Three Maintenance Planning
Planning procedure
Scheduling procedure
Scheduling technique
2. Weekly schedule
3. Daily schedule
Long-Range (master) Schedule
• Covering a period of 3 months to 1 year.
• Based on existing maintenance work orders
(blanket work order, backlog, PM, anticipated EM).
• Balancing long-term demand for maintenance work
with available resources.
• Spare parts and material could be identified and
ordered in advance.
• Subject to revision and updating to reflect changes
in the plans and maintenance work.
Weekly Schedule
• Covering 1 week.
• Generated from the master schedule.
• Takes into account current operations schedules and
economic considerations.
• Allow 10% to 15% of the workforce to be available for
emergency work.
• The schedule prepared for the current week and the
following one in order to consider the available backlog.
• The work orders scheduled in this week are sequenced based
in priority.
• CPM and integer programming techniques can be used to
generate a schedule.
Daily Schedule
• Covering 1 day.
• Generated from weekly schedule.
• Prepared the day before.
• Interrupted to perform EM.
• Priorities are used to schedule the jobs.
Elements of Sound Scheduling
Requirements for effective scheduling:
• Written work orders that are derived from a well-
conceived planning process. (Work to be done,
methods to be followed, crafts needed, spare parts
needed, and priority).
• Time standards.
• Information about craft availability for each shift.
• Stocks of spare parts and information on restocking.
Elements of Sound Scheduling
Requirements for effective scheduling:
• Information on the availability of special equipment
and tools necessary for maintenance work.
• Access to the plant production schedule and
knowledge about when the facilities will be
available for service without interrupting
production schedule.
• Well-define priorities for maintenance work.
• Information about jobs already scheduled that are
behind the schedule (backlog).
Scheduling Procedures (Steps)
• Sort backlog work orders by crafts.
• Arrange orders by priority.
• Compile a list of completed and carry over jobs.
• Consider job duration, location, travel distance, and
the possibility of combining jobs in the same area.
• Schedule multi-craft jobs to start at the beginning of
every shift.
• Issue a daily schedule (not for shutdown
maintenance).
• Authorize a supervisor to make work assignments
(dispatching).
Maintenance Job Priority System
• Priorities are established to ensure that the most
critical work is scheduled first.
• It is developed under coordination with operations
staff.
• It should be dynamic.
• It must be updated periodically to reflect changes in
operation and maintenance strategies.
• It typically includes three to ten levels of priority.
Scheduling Techniques
The objective of the scheduling techniques is to construct a time
chart showing:
The start and finish for each job.
The interdependencies among jobs.
The critical jobs that require special attention and effective
monitoring.
Such techniques are:
Modified Gantt chart
CPM
PERT
Integer and stochastic programming.
Introduction
Schedules show the timing for work elements and when specific
28
Scheduling Benefits
29
Scheduling Systems
30
Network Scheduling(PERT/CPM)
Terminologies
Activity
31
… Terminologies [ctd]
Critical Path
Critical Time
32
Building the Network
33
AOA Network [ Activity-on- Arrow]
Historically most popular
Nodes represent start and finish events for each activity
Arrows can only come from/go to single node
Only one arrow between two given nodes
Start
End of
of Activity
activit
activit
y
y
Event Event
34
Example [AOA Network]
A Sample Set of Project Activities, Precedence and Duration
35
Example [Completed AOA Network]
36
Dummy Activities
37
AON Network [Activity-on-Node]
The node (the block in the figure) is the activity; inside the node is
information about the activity, such as its duration, start time, and finish
time .
Requires no dummy nodes
38
AON vs. AOA Networks
39
Previous Example [Completed AON Network]
40
Calculation of Earliest and Latest Times
preceding nodes
Initialization : E1=0 [project start]
Ej=max(Ei+tij) for all i before node j
Ei
i j
Ej
41
Backward pass: determines Latest Start & Finish
investigated
i
j
Li Lj
42
Example [ Earliest Times]
Forward Pass [ ES and EF]
43
EXAMPLE [Latest Times]
Backward Pass [LS and LF]
44
Earliest and Latest Schedule
Activity Duration Earliest Earliest Latest Latest Total
[days] Start Finish Start Finish Float
a 5 0 5 0 5 0
b 4 0 4 7 11 7
c 3 5 8 8 11 3
d 4 5 9 7 11 2
e 6 5 11 5 11 0
f 4 8 12 11 15 3
g 5 9 14 12 17 3
h 6 11 17 11 17 0
i 6 12 18 15 21 3
j 4 17 21 17 21 0
45
Critical path, Activity Float
Activity Float=LS-ES=LF-EF
Finish]
46
Program Evaluation and Review Technique (PERT)
PERT is a network analysis technique used to estimate project
duration when there is a high degree of uncertainty about the
individual activity duration estimates
PERT uses probabilistic time
estimates
pessimistic (a)
most likely (m)
optimistic (b)
47
PERT Formula
Based on the distribution of the three time estimates[Beta-
distribution], the mean or expected time, te, and the variance, V,
of each activity are computed as:
48
Steps in PERT Analysis
For each activity k
Obtain ak, mk (mode) and bk
Compute expected activity duration (mean) dk=te
Compute activity variance Vk=s2
Compute expected project duration D=Te using standard CPM
algorithm
Compute Project Variance V=S2 as sum of critical path activity
variance (this assumes independence!)
In case of multiple critical paths use the one with the largest
variance
Calculate probability of completing the project
Assuming project duration normally distributed
49
Example -1 [PERT]
Time Estimates Mean Variance
Predeces
Task a m b
sor
A - 2 4 8 4.33 1
B - 4 6 10 6.33 1
C A 6 6 6 6.00 0
D A 2 8 14 8.00 4
E A 6 8 12 8.33 1
F B,C 9 3 15 6.00 1
G D,F 8 16 20 15.33 4
H D,F 4 4 4 4.00 0
I E.H 4 8 10 7.66 1
50
Forward and Backward Pass
2 E 5
8.33 I 7.66
A D 4.33
4.33 H 16.33 6
1 C 10.33
B
F 6 G 15.33
6.33 3 4
CriticalPath=A-C-F-G
Project Duration (Mean)= 31.66 | Variance=6 σ=2.45
51
Gantt Chart
schedule.
After the PERT/CPM analysis is completed, the following phase is
52
Gantt Chart
53
Gantt Chart
Characteristics:
The bar in each row identifies the corresponding task
The horizontal position of the bar identifies start and end times of the
task
Bar length represents the duration of the task
Good for allocating resources and re-scheduling
Precedence relationships can be represented using arrows
Critical activities are usually highlighted
Slack times are represented using bars with doted lines
The bar of each activity begins at the activity earliest start time (ES)
The bar of each activity ends at the activity latest finish time (LF).
A vertical cursor (such as a transparent ruler) placed at the review point
At a review point the boxes/lines are shaded to represent the actual
54
time spent
Gantt Chart
Advantages
Simple
Good visual communication to others
Task durations can be compared easily
Good for scheduling resources
Disadvantages
Dependencies are more difficult to visualise
Minor changes in data can cause major changes in the
chart
55
Constructing Gantt Chart
56
Constructing Gantt Chart
57
Constructing Gantt Chart
Step 1. Schedule critical tasks:
58
Constructing Gantt Chart
Step 2. Place time windows for non-critical tasks:
59
Constructing Gantt Chart
Step 3. Schedule non-critical tasks
Step 4. Indicate precedence relationships:
60
Resources Based Scheduling
Time is not the only restraint on a project plan.
The assumption made when doing a time analysis is that
resources are unlimited – which of course is not true.
Kind of resources :
People
Material
Equipment
Working Capital
Requires making trade-offs
Time constrained
Resource constrained
61
Resource Loading
62
Resource Allocation Methods
Time Constrained Projects
Resource Smoothing/Leveling is a technique used to re-allocate
resources and re- schedule activities
Smoothening resource demands by using positive slacks (non critical
activities) to manage resource utilization over the duration of the
project.
Peak resource demands are reduced.
Resources over the life of the project are reduced.
Fluctuation in resource demand is minimized.
Resource constrained
Scheduling resources within constraints with minimal extension of
63
schedule time
Resources Allocation and Smoothing
Once the project schedule, (e.g. GANTT chart), has been constructed, take
into account
Available resource hours
Slack times and
The project schedule
64
Resources Allocation and Smoothing
Example
65
Resources Allocation and Smoothing
The original schedule (constructed above) for this project is as
shown below.
67
Resources Allocation and Smoothing
Scenario I
Assume that there are 6 people available for working in this project but one of them returns from holidays at
time=2.
Re-scheduling is needed because activities A and B cannot be carried out in parallel until time=2.
68
Resources Allocation and Smoothing
Scenario II
Equipment and materials needed to carry out activities E and F are available at time=5 and time=9
respectively instead of being available at the activities ES time.
Re-scheduling is needed but the overall duration of the project is not affected.
69