Unit Ii
Unit Ii
Before the creation of hardware that could run MRP software, inventory was
scheduled by hand and was dominated by methods such as reorder point
(ROP)/reorder quantity (ROQ).
When it comes to the MRP inventory management system, there are three
primary objectives that the software seeks to provide.
1. To ensure that raw materials are readily available for production and
products are readily available for delivery to consumers.
2. To sustain the lowest raw materials and finished product levels in store.
3. To organize manufacturing, delivery schedules, and purchasing
activities.
As basic as the objectives sound, organizations would be significantly less
productive if it weren’t for the implementation of the MRP inventory system.
End Item: The MRP system requires the user to describe what type of product
is being created and its specific demand level.
Quantity: The system requires the user to input the amount of quantity needed
to meet specific demand schedules.
Shelf Life: The amount of time that a product is able to remain in the
warehouse is required for the planning aspect of an MRP system.
After inputting all the data throughout the system, it can be run in a business.
In the manufacturing sector, the two most dominant inventory systems are
the enterprise resource planning (ERP) system and material requirements
planning (MRP) system.
In terms of functionality, they both differ in specific ways. The MRP system is
designed to progressively increase inventory efficiency in a business through
control of manufacturing, scheduling, and purchasing. On the other hand, the
ERP system provides financing, manufacturing, supply chain, purchasing,
selling, and planning in one single system.
Compositionally, MRP is a solo system that is used for its extensive focus on
providing few functions while the ERP system is integrated and provides
multiple functions in one unit. In addition, MRP systems can be easily
combined with other inventory software, but this is not the case for ERP
systems.
With MRP, inventory can be optimized via planning receipts according to the
needs so that surplus inventory
could be avoided.
Sales and distribution give concrete customer requirements from the market.
In Demand Management, sales are planned in advance via a sales forecast.
The sales forecast is entered in demand
management in the form of Planned Independent Requirement (PIR), i.e., the
requirement for the finished product.
If a material shortage exists, planned orders are created at every BOM level to
fulfill the requirements and purchase
requisitions are generated for externally procured raw materials. You can also
create planned orders for externally
procured materials which can be converted to purchase requisition.
MRP does lead time scheduling and calculates planned order dates based on
routing times. Basically, it does
backward scheduling starting from requirement date minus (GR processing
times, in-house production time, float
time before production ) and calculates the duration of planned orders.
MRP type "PD" in material master MRP 1 view is essential to run the MRP for
the materials. If, you don't want to run MRP on the material then MRP type
"ND" can be maintained in the material master.Master Production Schedule
(MPS) It is used specifically for critical materials usually high valued products
where you do not want changes in your production plan within planning time
fence in next MPS run, and production plan gets firmed automatically as soon
as it comes within planning time fence unlike MRP run.
A separate run occurs for the MPS items; they are not included in the MRP
run.
Basically, it ensures the availability of the critical resources, which should
not hamper the production by maintaining the stock.
Planning time fence (number of days starting from current date) is useful in
case of MPS scenario where one can save the procurement proposals
(planned orders) from undergoing any change since the last MRP run.
MRP type " P0" to "P3" in material master should be maintained to run MPS for
materials.
MRP Planning Parameters MRP parameters are required for MRP run in terms
of considering the requirements (PIR) in planning horizon, scheduling
parameters and about the usage of BOM and routing data.
1. Processing Key
1. Net change (NETCH): In this run, the system considers those materials in
the planning run from their last MRP run which have undergone some changes
pertaining to receipts and issues or any stock changes.
2. Net Change in Planning Horizon (NETPL): In this run, the system considers
those materials in the planning run from their last MRP run which have
undergone some changes pertaining to receipts and issues or any stock
changes. It considers the requirements in a pre-defined planning horizon,
unlike NETCH key which considers the total futuristic requirements.
3. Regenerative Planning (NEUPL): It plans all the materials for the MRP Run
irrespective of the changes they undergo. This plan is not so widely used. It
takes a long time to obtain the final result.
2. Planning Mode
1. Adapt planning data: It only processes the changed data.
2. Re explodes BOM and Routing: Read BOM and routing data again for the
existing orders.
3. Delete and recreate planning data: It completely deletes the planning data
(all receipts) and creates again.
3. Scheduling
1. Basic Scheduling: MRP calculates only basic dates for the orders and in
house production time for the material master is used.
2. Lead Time Scheduling: The production dates are determined by the lead
time scheduling for planned orders. The routings are read to schedule and
calculate the capacity requirements on work centers.How to run MRP for all
Products
Step 1) From SAP easy access screen, open transaction MD01, we will run
MRP at Plant level.
1. Enter your manufacturing Plant for which you want to take MRP run.
2. Enter Processing key as "NETCH" ( Net change in total horizon)
3. Input "1" in Create Purchase req. Which means for externally procured
materials, MRP will generate purchase requisitions instead of planned orders.
4. Enter "3" for schedule lines which means MRP will generate schedule lines
for raw materials having scheduling agreement.
5. Enter "1" in MRP List and system will create MRP list similar to stock
/requirement list for later analysis of previous MRP run.
6. Enter Planning mode "3" as we will delete and recreate all planning data for
all materials.
7. Enter Scheduling indicator "2" which means MRP will do lead time
scheduling and consider routing times to calculate planned order dates.
MAKE-OR-BUY DECISION
The make-or-buy decision is the action of deciding between manufacturing an
item internally (or in-house) or buying it from an external supplier (also known
as outsourcing). Such decisions are typically taken when a firm that has
manufactured a part or product, or else considerably modified it, is having
issues with current suppliers, or has reducing capacity or varying demand.
Another way to define make-or-buy decision that is closely related to the first
definition is this: a decision to perform one of the activities in the value chain
in-house, instead of purchasing externally from a supplier. A value chain is the
complete range of tasks – such as design, manufacture, marketing and
distribution of a product / service that businesses must get done to take a
service or product from conception to their customers Some companies
manage all of the tasks in the value chain from manufacturing raw materials all
through to the ultimate distribution of the completed goods and provision of
after-sales services. Some other companies are happy just to integrate on a
smaller scale by buying a lot of the parts and materials that are required for
their finished products. When a business is involved in more than one activity
in the whole value chain, it is vertically integrated. This kind of integration is
quite common.
Though the cost is rarely the sole criterion utilized to come to a make-or-buy
decision, easy break-even analysis can be a useful way to quickly guess the
expense implications within a decision.
For example, an airline might wish to minimize the number of airport gates
required for its aircraft, in order to reduce costs, and scheduling software can
allow the planners to see how this can be done, by analyzing time tables,
aircraft usage, or the flow of passengers.
Scheduling Types
Companies use backward and forward scheduling to allocate plant and
machinery resources, plan human resources, plan production processes and
purchase materials.
Forward scheduling is planning the tasks from the date resources become
available to determine the
shipping date or the due date.
Backward scheduling is planning the tasks from the due date or required-by
date to determine the start date and/or
any changes in capacity required.
OPERATIONS SCHEDULING
Scheduling pertains to establishing both the timing and use of resources within
an organization. Under the operations function (both manufacturing and
services), scheduling relates to use of equipment and facilities, the scheduling
of human activities, and receipt of materials.
While issues relating to facility location and plant and equipment acquisition
are considered long term and aggregate planning is considered intermediate
term, operations scheduling is considered to be a short-term issue. As such, in
the decision-making hierarchy, scheduling is usually the final step in the
transformation process before the actual output (e.g., finished goods) is
produced. Consequently, scheduling decisions are made within the constraints
established by these longer term decisions . generally s che duling obje ctive s
de a ls with trade offs among conflicting goa ls for efficie nt utiliza tion of la bor
a nd e quipme nt, le a d time , inve ntory le ve ls , a nd processing times.
With backward scheduling, the scheduler begins with a planned receipt date or
due date and moves backward in time, according to the required processing
times, until he or she reaches the point where the order will be released.
Of course there are other variables to consider other than due dates or
shipping dates. Other factors which directly impact the scheduling process
include: the types of jobs to be processed and the different resources that can
process each, process routings, processing times, setup times, changeover
times, resource availability, number of shifts, downtime, and planned
maintenance.
LOADING
Loading involves assigning jobs to work centers and to various machines in
the work centers. If a job can be processed on only one machine, no difficulty
is presented. However, if a job can be loaded on multiple work centers or
machines, and there are multiple jobs to process, the assignment process
becomes more complicated. The scheduler needs some way to assign jobs to
the centers in such a way that processing and setups are minimized along with
idle time and throughput time.
Two approaches are used for loading work centers: infinite loading and finite
loading. With infinite loading jobs are assigned to work centers without regard
for capacity of the work center. Priority rules are appropriate for use under the
infinite loading approach. Jobs are loaded at work centers according to the
chosen priority rule. This is known as vertical loading.
Finite loading projects the actual start and stop times of each job at each work
center. Finite loading considers the capacity of each work center and
compares the processing time so that process time does not exceed capacity.
With finite loading the scheduler loads the job that has the highest priority on
all work centers it will require. Then the job with the next highest priority is
loaded on all required work centers, and so on. This process is referred to as
horizontal loading. The scheduler using finite loading can then project the
number of hours each work center will operate.
SEQUENCING
Sequencing is concerned with determining the order in which jobs are
processed. Not only must the order be determined for processing jobs at work
centers but also for work processed at individual work stations. When work
centers are heavily loaded and lengthy jobs are involved, the situation can
become complicated. The order of processing can be crucial when it comes to
the cost of waiting to be processed and the cost of idle time at work centers.
There are a number of priority rules or heuristics that can be used to select the
order of jobs waiting for processing. Some well known ones are presented in a
list adapted from Vollmann, Berry, Whybark, and Jacobs (2005):
Random (R). Pick any job in the queue with equal probability. This rule is
often used as a benchmark for other rules.
First come/first served (FC/FS). This rule is sometimes deemed to be fair
since jobs are processed in the order in which they arrive.
Shortest processing time (SPT). The job with the shortest processing time
requirement goes first. This rule tends to reduce work-in-process inventory,
average throughput time, and average job lateness.
Earliest due date (EDD). The job with the earliest due date goes first. This
seems to work well if the firm performance is judged by job lateness.
Critical ratio (CR). To use this rule one must calculate a priority index using the
formula (due date–now)/(lead time remaining). This rule is widely used in
practice.
Least work remaining (LWR). An extension of SPT, this rule dictates that work
be scheduled according to the processing time remaining before the job is
considered to be complete. The less work remaining in a job, the earlier it is in
the production schedule.
Slack time (ST). This rule is a variant of EDD; it utilizes a variable known as
slack. Slack is computed by subtracting the sum of setup and processing times
from the time remaining until the job's due date. Jobs are run in order of the
smallest amount of slack.
Slack time per operation (ST/O). This is a variant of ST. The slack time is
divided by the number of operations remaining until the job is complete with
the smallest values being scheduled first.
Least setup (LSU). This rule maximizes utilization. The process calls for
scheduling first the job that minimizes changeover time on a given machine.
These rules assume that setup time and setup cost are independent of the
processing sequence. However, this is not always the case. Jobs that require
similar setups can reduce setup times if sequenced back to back. In addition to
this assumption, the priority rules also assume that setup time and processing
times are deterministic and not variable, there will be no interruptions in
processing, the set of jobs is known, no new jobs arrive after processing
begins, and no jobs are canceled. While little of this is true in practice, it does
make the scheduling problem manageable.
GANTT CHARTS
Gantt charts are named for Henry Gantt, a management pioneer of the early
1900s. He proposed the use of a visual aid for loading and scheduling.
Appropriately, this visual aid is known as a Gantt chart. This Gantt chart is
used to organize and clarify actual or intended use of resources within a time
framework. Generally, time is represented horizontally with scheduled
resources listed vertically. Managers are able to use the Gantt chart to make
trial-and- error schedules to get some sense of the impact of different
arrangements.
There are a number of different types of Gantt charts, but the most common
ones, and the ones most appropri ate to our discussion, are the load chart and
schedule chart. A load chart displays the loading and idle times for machines
or departments; this shows when certain jobs are scheduled to start and finish
and where idle time can be expected. This can help the scheduler redo loading
assignments for better utilization of the work centers. A schedule chart is used
to monitor job progress. On this type of Gantt chart, the vertical axis shows the
orders or jobs in progress while the horizontal axis represents time. A quick
glance at the chart reveals which jobs are on schedule and which jobs are on
time.
Gantt charts are the most widely used scheduling tools. However, they do
have some limitations. The chart must be repeatedly updated to keep it current.
Also, the chart does not directly revealcosts of alternate loadings nor does it
consider that processing times may vary among work centers.
On this page we will explain how to make a Gantt chart. If you need to
understand the concept of the Gantt chart, you can read: What is a Gantt
Chart?
Gantt charts are created using project management information system (PMIS)
applications, such as Primavera Project Planner®, Microsoft Project®,
and MindView®. A typical approach for creating a schedule is to hold meetings
with selected project team members and to begin identifying activities. While
this approach will result in a schedule, it may not be a complete schedule. A
complete schedule contains enough activities to ensure compliance with
the 100% Rule. The 100% Rule requires that the scope baseline addresses
100% of the project scope. The scope baseline components are the primary
sources used to identify the schedule activities. If the scope baseline
addresses 100% of the project scope, then the schedule activities address
100% of the project scope. Following these steps will ensure that the final
project schedule is a complete schedule.
Gather the team and review the approved scope baseline, which consists of
three components: 1) the Scope Statement, 2) the Work Breakdown
Structure (WBS) and 3) the WBS Dictionary. The project team member should
confirm that the scope baseline addresses 100% of the project scope.
Using a technique called Decomposition, the project team breaks down each
WBS work package into activities. Just like when creating the WBS work
packages, the team needs to set rules for creating schedule activities. The
final schedule needs to be the one that is effective and efficient. Too many
activities can be as bad as too few. It is also important to identify deadlines and
milestones while decomposing the project.
Step 3 - Sequence Activities
Every activity is related to one or more other activities. Every activity, except
the first and last, has a relationship with a predecessor and a successor.
Sequencing activities means placing the activities in the right order using the
right relationships. There are four types of relationships:
Duration is the time between the start and end of an activity. Review the
resources, relationships and sequencing, then estimate the duration for each
activity. The same estimating techniques used for estimating resources can be
used to estimate durations, but make sure you identify constraints. Which are
limitations or restrictions on an activity.
Create the Gantt chart by loading all information into a project management
software tool. Review the schedule and ensure that all schedule risks have
been addressed. Check that response plans and schedule contingencies have
been included. A typical way to address schedule contingencies is to add
Buffers at the activity level, the project level or both. A Buffer is an activity with
no resources or scope to provide additional time and reduce schedule risks.
Resource optimization techniques, such as resource smoothing or leveling are
used to create realistic schedules. Review and approve the schedule. The
approved Gantt chart schedule becomes the schedule baseline.
MAINTENANCE MANAGEMENT
Maintenance management is the process of overseeing maintenance
resources so that the organization does not experience downtime from broken
equipment or waste money on inefficient maintenance procedures.
Maintenance management software programs can assist with the process.
The primary objectives of maintenance management are to schedule work
efficiently, control costs and ensure regulatory compliance.
Importance
Maintenance management is essential to the success of any organization
because a poorly- organized maintenance program can bring the entire
company to a halt. For instance, if maintenance employees are fixing a broken
photocopier instead of an essential piece of production equipment, a factory
can stop producing anything. If the maintenance manager doesn't understand
company processes well enough to know what is most important, this type
of scheduling problem becomes more likely. If the maintenance manager
schedules four employees when only one is needed, the company will lose
money. If materials such as chemicals are not stored and disposed of properly,
the company could have compliance issues.
IMPORTANCE AND OBJECTIVES OF MAINTENANCE MANAGEMENT
Maintenance is an important factor in quality assurance, which is another basis
for the successful competitive edge.
Inconsistencies in equipments lead to variability in product characteristics and
result in defective parts that fail to meet the established specifications. Beyond
just preventing break downs, it is necessary to keep equipments operating
within specifications (i.e. process capability) that will produce high level of
quality.
Good maintenance management is important for the company as a cost
control. As companies go in for automation
to become more competitive, they increasingly rely on equipments to produce
a greater percentage of their output. It becomes more important that,
equipments operate reliably within specifications. The cost of idle time is
higher as equipment becomes more high- tech and expensive e.g. NC/CNC
machines and robots.
Dependability of service is one of the performance measures by which a
company can distinguish itself from others.
To establish a competitive edge and to provide good customer service,
companies must have reliable equipments that will respond to customer
demands when needed. Equipments must be kept in reliable condition without
costly work stoppage and down time due to repairs, if the company is to
remain productive and competitive.
Many manufacturing organizations, particularly those with JIT (Just-In-Time)
programs are operating with inventories so low that, they offer no protection in
the event of a lengthy equipment failure. Beyond the cost of idle equipment,
idle labor, and lost ales that can result from a breakdown, there is a danger of
permanently losing market shares to companies that are more reliable.
Maintenance function can help prevent such as occurrence.Organizations like
airlines and oil refineries have huge investments in the equipment. Equipment
failure will be disastrous for such companies. They need proper maintenance
to keep the equipment in good condition.
Impact of Poor Maintenance
Maintenance operations include all efforts to keep production facilities and
equipments in an acceptable operating condition. Failure or ml-functioning of
machines and equipments in manufacturing and service industries have a
direct impact on the following:
1. Production capacity:
Machines idled by breakdowns cannot produce, thus the capacity of the
system is reduced.
2. Production costs:
Labor costs per unit rise because of idle labor due to machine breakdowns.
When machine malfunctions result in scrap, unit labor and material costs
increase. Besides, cost of maintenance which includes such costs as costs of
providing repair facilities, repair crews, preventive maintenance inspections,
spare parts and stand by machines will
increase as machines break down frequently.
3. Product and service quality:
Poorly maintained equipments produce low quality products. Equipments that
have not been properly maintained have frequent break downs and cannot
provide adequate service to customers. For example, air craft fleets of the
airline, railway and road transport services not maintained well can result in
poor service to customers.
4. Employee or customer safety:
Worn-out equipment is likely to fail at any moment and these failures can
cause injuries to the workers, working on those equipments. Products such as
two wheelers and automobiles, if not serviced periodically, can break down
suddenly and cause injuries to the stress.
5. Customer satisfaction:
When production equipments break own, products often can not be produced
according to the master production schedules, due to work stoppages. This will
lead to delayed deliveries of products to the customers.Objectives of
Maintenance Management
No matter how much time and attention you pay to plan for your project,
obstacles can still arise and delay completion. That’s where project crashing
comes in. Project crashing in project management is a method used to speed
up a project’s timeline by adding additional resources without changing the
scope of the project. Crashing activities in project management could include
adding extra personnel to a task to finish it more quickly, or it could involve
paying a premium for a faster result.
Let’s consider this simple project crashing example. Your team is tasked with
launching a magazine to celebrate your company’s 50th anniversary, but
delays in approving the lead feature have caused the project to fall behind. In
order to ensure the magazine is in hand by the anniversary party, an element
of the project’s scope that can’t be changed, you choose to pay a rush fee for
the printer. This project crashing step helped you meet the immovable
deadline, but it also increased your project budget.
Waiting until the roofers have another opening might seem like a choice that
could preserve the budget, but it would likely lead to more delays in
succeeding elements like electricity or flooring, which can’t be started without a
roof. Additional delays will inevitably impact other scheduled projects that can’t
start because manpower is tied up in this incomplete house. Because the
scope of the project cannot change in order to reach completion, crashing
activities will be necessary here as well.
Once you’ve made the decision to use project crashing, there are some steps
you’ll want to follow to get the results you want.
1. Critical Path
The first thing to do is analyze the critical path of your project. This will help
you determine which tasks can be shortened to bring the project to a close
sooner. Therefore, if you haven’t already, calculate your critical path, see
which tasks are essential and which are secondary to the project’s success.
2. Identify Tasks
Get a list of all the tasks you have, then meet with those who have been
assigned to complete them. Ask if they believe any of the tasks they’re
responsible for are in the critical path and can be cut down. Then, start looking
for ways to tighten up those tasks.
Once you’ve narrowed down the tasks in the critical path that you believe can
be shortened, start calculating how much adding more resources will cost.
Find the tasks that can be allocated additional resources, and come in sooner
with the least amount of strain on your budget.
When you know what you will have to spend (compared to how much time
you’ll save) for each of the tasks in your critical path, you must now make a
decision and choose the least expensive way forward. Project crashing is not
just adding resources to get done faster, but it’s getting the most in return for
that extra expense.
5. Create a Budget
Like any project, once you’ve decided on your plan, you have to pay for it.
Making a project crashing budget is the next step in executing your project
crashing plan. You’ll have to update your baseline, schedule and resource
plan to align with your new initiative.
Introduction
The critical path method (CPM) aims at the determination of the time to complete a
project and the important activities on which a manager shall focus attention.
In CPM, it is assumed that precise time estimate is available for each activity.
From the start event to the end event, the time required to complete all the activities of
the project in the specified sequence is known as the project completion time.
Path In A Project
Consider all the paths in a project, beginning with the start event and stopping at the
end event. For each path, calculate the time of execution, by adding the time for the
individual activities in that path.
The path with the largest time is called the critical path and the activities along this
path are called the critical activities or bottleneck activities. The activities are called
critical because they cannot be delayed. However, a non-critical activity may be
delayed to a certain extent. Any delay in a critical activity will delay the completion
of the whole project. However, a certain permissible delay in a non –critical activity
will not delay the completion of the whole project. It shall be noted that delay in a
non-critical activity beyond a limit would certainly delay the completion the whole
project. Sometimes, there may be several critical paths for a project. A project
manager shall pay special attention to critical activities.
Key Concepts
1.Activity
2.Event
Example
3.Predecessor Event
The event just before another event is called the predecessor event.
4.Successor Event
The event just following another event is called the successor event.
Example:
5.Network
A network is a series of related activities and events which result in an end product or
service. The activities shall follow a prescribed sequence. For example, while
constructing a house, laying the foundation should take place before the construction
of walls. Fitting water tapes will be done towards the completion of the construction.
Such a sequence cannot be altered.
6.Dummy Activity
A dummy activity is an activity which does not consume any time. Sometimes, it may
be necessary to introduce a dummy activity in order to provide connectivity to a
network or for the preservation of the logical sequence of the nodes and edges.
7.Construction of a Project Network
An event takes place at a point of time whereas an activity takes place from one point
of time to another point of time.
Problem 1
Construct the network diagram for a project with the following activities:
Solution
The activities A, B, C start from node 1 and none of them has a predecessor activity.
A joins nodes1 and 2; B joins nodes 1 and 3; C joins nodes 1 and 4. So we get the
following:
This is a part of the network diagram that is being constructed. Next, activity D has A
as the predecessor activity. D joins nodes 2 and 5. So we get
Next, activity E has B as the predecessor activity. E joins nodes 3 and 6. So we get
Develop a network diagram for the project specified below:
The critical path method (CPM) aims at the determination of the time to complete a
project and the important activities on which a manager shall focus attention.
Solution For The Example Problem - Shortest Path Problem
Looking at the diagram, we see that node 1 is the origin and the nodes 2 and 3 are
neighbours to the origin. Among the two nodes, we see that node 2 is at a distance of
40 units from node 1 whereas node 3 is at a distance of 100 units from node 1. The
minimum of {40, 100} is 40.
Solution For The Example Problem
Looking at the diagram, we see that node 1 is the origin and the nodes 2 and 3 are
neighbours to the origin. Among the two nodes, we see that node 2 is at a distance of
40 units from node 1 whereas node 3 is at a distance of 100 units from node 1. The
minimum of {40, 100} is 40. Thus, the node nearest to the origin is node 2, with a
distance of 40 units. So, out of the two nodes 2 and 3, we select node 2. We form a set
of nodes {1, 2} and construct a path connecting the node 2 with node 1 by a thick line
and mark the distance of 40 in a box by the side of node 2. This first iteration is
shown in the following diagram.
Iteration No. 1
Now we search for the next node nearest to the set of nodes {1, 2}. For this purpose,
consider those nodes which are neighbours of either node 1 or node 2. The nodes 3, 4
and 5 fulfill this condition. We calculate the following distances.
Minimum of {75, 135} = 75. Hence we select the path 1 → 2 → 3 and display this
path by thick edges. The distance 75 is marked in a box by the side of node 3. We
obtain the following diagram at the end of Iteration No. 2.
Iteration No. 2
We repeat the process. The next node nearest to the set {1, 2, 3} is either node 4 or
node 5.
As regards node 5, there are two paths viz. 2 → 5 and 3 → 5, providing a link to the
origin. We already know the shortest routes from nodes 2 and 3 to the origin. The
minimum distances have been indicated in boxes near these nodes. The path 3 → 5
involves the shortest distance. Thus, the distance between nodes 1 and 5 is 95 units
(20 units between nodes 5 and 3 + 75 units between node 3 and the origin).
Therefore, we select node 5 and enlarge the set from {1, 2, 3} to {1, 2, 3, 5}. The
distance 95 is marked in a box by the side of node 5. The following diagram is
obtained at the end of Iteration No. 3.
Iteration No. 3
Now 2 nodes remain, viz., nodes 4 and 6. Among them, node 4 is at a distance of 135
units from the origin (95 units from node 4 to node 2 + 40 units from node 2 to the
origin). Node 6 is at a distance of 135 units from the origin (40 + 95 units). Therefore,
nodes 4 and 6 are at equal distances from the origin. If we choose node 4, then
travelling from node 4 to node 6 will involve an additional distance of 40 units.
However, node 6 is the ending node. Therefore, we select node 6 instead of node 4.
Thus the set is enlarged from {1, 2, 3, 5} to {1, 2, 3, 5, 6}. The distance 135 is marked
in a box by the side of node 6. Since we have got a path beginning from the start node
and terminating with the stop node, we see that the solution to the given problem has
been obtained. We have the following diagram at the end of Iteration No. 4.
Iteration No. 4
Minimum Distance
Referring to the above diagram, we see that the shortest route is provided by the path
1 → 2 → 3 → 5 → 6 with a minimum distance of 135 units.
The critical path method (CPM) aims at the determination of the time to complete a
project and the important activities on which a manager shall focus attention.
Note that in CPM, the assumption is that precise time estimate is available for each
activity in a project. However, one finds most of the times that this is not practically
possible.
In PERT, we assume that it is not possible to have precise time estimate for each
activity and instead, probabilistic estimates of time alone are possible. A multiple time
estimate approach is followed here. In probabilistic time estimate, the following 3
types of estimate are possible:
The optimistic estimate of time is based on the assumption that an activity will not
involve any difficulty during execution and it can be completed within a short period.
On the other hand, a pessimistic estimate is made on the assumption that there would
be unexpected problems during the execution of an activity and hence it would
consume more time. The most likely time estimate is made in between the optimistic
and the pessimistic estimates of time. Thus the three estimates of time have the
relationship
t o ≤ t m ≤ tp
Practically speaking, neither the pessimistic nor the optimistic estimate may hold in
reality and it is the most likely time estimate that is expected to prevail in almost all
cases. Therefore, it is preferable to give more weight to the most likely time estimate.
We give a weight of 4 to most likely time estimate and a weight of 1 each to the
pessimistic and optimistic time estimates. We arrive at a time estimate ( te ) as the
weighted average of these estimates as follows:
let’s analyze the activities and their immediate predecessors.
Activities A, B, and C don’t have any immediate predecessors. This means that each
of them will have individual arcs connecting to them. First, we’ll draw nodes 1 (which
is the starting point) and 2. We’ll add the activity on the arc, along with the duration.
We’ll have to also keep in mind that A acts as the immediate predecessor for both
nodes E and F. Similarly, let’s draw the arcs for nodes B and C.
Before we can draw the nodes for activity D, a quick look at the table will tell us that
it is preceded by activity B and that a combination of activities C and D act as
immediate predecessors for activities H and J. This means that both activities C and D
have to connect at some point. That’s why we’ll be drawing an arc from events 3 and
4.
So now, we’ve completed activities A, B, C, and D of the critical path method. Next,
let’s take a look at activity E.
Activity E is preceded by activity A and acts as the immediate predecessor for activity
J. Since this is an independent activity, we’ll be able to draw an arc like this.
If we have a look at activity F, it’s preceded by activity A, and a combination of F, G,
and H act as immediate predecessors for the activities K and L. So let’s wait before
we take it up. Instead, let’s shift our attention to activity G. It’s preceded by B. So,
we’ll draw it like so.
Now, let’s take a look at activity H. It is preceded by both C and D and will act as the
immediate predecessor for K and L, along with F and G. So, we can connect node 4 to
6.
Now that we’ve done that, let’s go back to activity F. Now that we know where
activities G and H connect to, we can combine nodes 2 and 6, fulfilling the conditions
required for activities K and L.
Next, let’s take a look at activity J. Activity J is preceded by activity E. We can also
see that a combination of J and K will act as an immediate predecessor for activity N.
We can then draw an arc like this.
Let’s go on to activity K. Here we can see that K is preceded by F, G, and H. It also
acts as an immediate predecessor to activity N. So, we’ll connect nodes 6 to 8.
Next, let’s continue with activity L. The table now shows that L, M, and N don’t act
as immediate predecessors for any other activity. Hence it can be assumed that it’ll
connect to the final node.
Now, to find the critical path. For this, we’ll need to find two values, Earliest Start
Time (Es) and Latest Completion Time (Lc).
The process of determining the Es for all events is called a forward pass.
The process of determining the Lc for all events is called a backward pass.
Let’s get into the forward pass. For this, first, we’ll need to create boxes at all nodes.
These are then divided into two. The lower half of the box represents the earliest start
time of the node, while the upper half represents the latest completion time.
Your network diagram should look something like this.
For this, we’ll be using the formula, Esj = max (Esi + Dij)
Which when simplified, the earliest start time for the second node (head node), is the
maximum of the combination of the earliest start time of the tail node and the duration
between the two nodes.
For node 2,
it would be, Es2 = 0 (earliest start time for node 1) + 3 (duration between 1 and 2) = 3
For node 3,
For node 4, we can see that two arcs connect to it. This means that we’ll need to
choose among the largest of the two options available to us.
Es4 = 0(Es0) + 6 = 6 or
Es4 = 4(Es3) + 3 = 7
We’ll choose 7 since it’s larger.
Similarly, we have three options to choose from when it comes to node 6. Since three
arcs connect to it.
Hence we’ll select the last option since it’s the largest among the three.
Now, for node 5. Since it’s directly connected to node 2, we can directly apply the
formula.
Now for node 7. We can directly apply the formula to these nodes.
It has 3 nodes connecting towards it. We’ll have to choose the maximum of the three.
Es9 = 18(Es8) + 9(D8-9) = 27
We’ll choose the arc from node 8 since it’s got the highest value.
And like that, the forward pass is complete. Now, for the second part of the critical
path method. Let’s take up the backward pass. For that’ we will be using the
following formula.
This, when put simply, means the latest completion time of the tail node is equal to
the latest completion time of the head node minus the distance between the two.
Now, let’s have a look at the latest completion time for node 7. Since there’s a direct
connection between nodes 9 and 7.
Lc7 = 27(Lc9) - 6(D9-7) = 21
Let’s move on to node 6. As we can see in the diagram, there are two points extending
to nodes 8 and 9 from node 6. So we have two options to choose from.
Next up, let’s find the latest completion time for node 4.
Since there are two connections extending from the node, to nodes 6 and 7
respectively, we’ll need to select the minimum between the two.
Lc4 = 21(Lc7) - 4(D4-7) = 17
Since there are two nodes connecting from node 3 to nodes 4 and 6. So, we’ll need to
choose between the 2.
Now, for the final step of the critical path method. To determine the critical path,
there are three major criteria that need to be satisfied.
Esi = Lci
Esj = Lcj
Since we have taken 6 units ( 1 for tp , 4 for tm and 1 for to ), we divide the sum by 6.
With this time estimate, we can determine the project completion time as applicable
for CPM.
Since PERT involves the average of three estimates of time for each activity, this
method is very practical and the results from PERT will be have a reasonable amount
of reliability.
t o ≤ t m ≤ tp
Find out the time required to complete the following project and the critical activities:
Using the single time estimates of the activities, we get the following network
diagram for the project.