Applications of Computer in Yarn/Fabric/Wet/Apparel/Management Lecture # Project Management

Critical Path Analysis

Problem-1: Consider the following table
Activity Predecessor Mean Duration
A - 7
B - 3
C - 4
D A 2
E A, B 3
F C 5
G C 3
H E, F 4
I E, F 5
J D, H 6
K I, G 3

• Construct the project network.

• Find earliest start time (ES) and least completion time (LC) of each node.
• Find the critical path and expected project completion time.
• Find the total float and free float of each activity.

# The CPM network is shown below:

Critical Path and Project Completion Time:

Critical Path: The critical path of a project network is the longest path in the network. It can be identified by
listing all possible paths from source to destination and then choosing the maximum path.

Earliest Start Time (ES): Let, Dij be the duration of the activity. ESj be the earliest start times of all the activities
which are emanating from node j (shown lower square side in the network). ESj is defined as ESj=max(ESi+Dij).
Least Completion Time (LC): LCi be the latest completion time and defined as LCi=min(LCj-Dij). LCi values are
shown in the upper squares in the network.
A.N.M. Bazlur Rashid, Assistant Professor (Computer) & Head, Department of Allied Engineering, Bangladesh University of Textiles / Page 1 of 9
 Applications of Computer in Yarn/Fabric/Wet/Apparel/Management Lecture # Project Management

An activity is said to be critical if all the following conditions are satisfied.

ESi=LCi ESj=LCj ESj-ESi=LCj-LCi=Dij
That is, whenever, we have a upper square value=lower square value in the network, we can add it into critical
path. Thus the critical path of our given problem is A-dummy-E-H-J.
Project completion time = 20;
Computing Total Floats and Free Floats:
Total Floats= LCj-ESi-Dij and Free Floats=ESj-ESi-Dij
Now, the following table shows us the TF and FF values required in this problem.
SL Activity Duration TF FF
1 1-2 7 7-0-7=0 7-0-7=0
2 1-3 3 7-0-3=4 7-0-3=4
3 1-4 4 5-0-4=1 4-0-4=0
4 2-3 0 7-7-0=0 7-7-0=0
5 3-5 3 10-7-3=0 10-7-3=0
6 3-6 2 14-7-2=5 14-7-2=5
7 4-5 5 10-4-5=1 10-4-5=1
8 4-7 3 17-4-3=10 15-4-3=8
9 5-6 4 14-10-4=0 14-10-4=0
10 5-7 5 17-10-5=2 15-10-5=0
11 6-8 6 20-14-6=0 20-14-6=0
12 7-8 3 20-15-3=2 20-15-3=2

NOTE:
ES is defined as- take the maximum path cost from all possible paths from starting node to node n.
LC is defined as- take the minimum value from all possible paths from node n to ending node.
TF is calculated as- target’s upper square-source’s lower square-path cost.
FF is calculated as- target’s lower square-source’s lower square-path cost.

Problem-2: A small project consists of seven activities for which the relevant data are given below.
Activity Predecessor Mean Duration
A - 4
B - 7
C - 6
D A,B 5
E A,C 7
F C,D,E 6
G C,D,E 5

• Construct the project network.

• Find earliest start time (ES) and least completion time (LC) of each node.
• Find the critical path and expected project completion time.
• Find the total float and free float of each activity.

A.N.M. Bazlur Rashid, Assistant Professor (Computer) & Head, Department of Allied Engineering, Bangladesh University of Textiles / Page 2 of 9
 Applications of Computer in Yarn/Fabric/Wet/Apparel/Management Lecture # Project Management

# The CPM network is shown below:

# Determining Critical Path and Project Completion Time:

By the same way as in problem-1, we get the critical path C-E-F and project completion time is 19.

# Computing Total Floats and Free Floats:

Now, the following table shows us the TF and FF values required in this problem.
SL Activity Duration TF FF
1 1-2 7 1 0
2 1-3 4 2 0
3 1-4 6 0 0
4 2-5 5 1 1
5 3-2 0 3 3
6 3-4 0 2 2
7 4-5 7 0 0
8 4-5 0 7 7
9 5-6 5 1 0
10 5-7 6 0 0
11 6-7 0 1 1

A.N.M. Bazlur Rashid, Assistant Professor (Computer) & Head, Department of Allied Engineering, Bangladesh University of Textiles / Page 3 of 9
 Applications of Computer in Yarn/Fabric/Wet/Apparel/Management Lecture # Project Management

Linear Programming
Linear programming is a mathematical programming technique to optimize performance under a set of
resource constraints as specified by an organization.

Assumption of linear programming:

The following four assumptions are made in the linear programming problems.
• Linearity: The amount of resource required for a given activity level is directly proportional to the
level of that activity.
• Divisibility: This means that fractional values of the decision variables are permitted.
• Non-negativity: This means that the decision variables are permitted to have only the values which
are greater than or equal to zero.
• Additivity: This means that the total output for a given combination of activity levels is the algebraic
sum of the output of each individual process.

Linear Programming Model:

The model of any Linear Programming problem will contain-
• Decision Variable
• Objective Function Coefficient
• Objective Function
• Technological Coefficient
• Resource Availability
• Set of Constraints
• Non-negativity Constraints

Example 1:
A company manufactures two different types of products: P1 and P2. Each product requires processing on
Milling Machine and Drilling Machine. But each type of machines has limited hours available per week. The
net profit per unit of the products, resource requirements of the products and availability of resources are
summarized in following table.

Processing Time (hours) Machine hours

Machine Type
Product P1 Product P2 available per week
Milling Machine 2 5 200
Drilling Machine 4 2 240
Profit/unit ($) 250 400

A.N.M. Bazlur Rashid, Assistant Professor (Computer) & Head, Department of Allied Engineering, Bangladesh University of Textiles / Page 4 of 9
 Applications of Computer in Yarn/Fabric/Wet/Apparel/Management Lecture # Project Management

Solution:
Let us prepare a model for this Linear Programming problem step by step.
# Decision Variable: X1 and X2 are the production volumes of the products P1 and P2
respectively.
# Objective Function Coefficient: Let, C1 be the profit per unit of product P1, which is equal to 250$ and
C2 be the profit per unit of product P2, which is equal to 400$.
# Objective Function: Maximize Z=C1X1+C2X2=250X1+400X2
# Technological Coefficient: 2,5 
4,2
 
# Resource Availability: 200
240
 
# Set of Constraints: 2X1+5X2≤200
4X1+2X2≤240
# Non-negativity Constraints: X1 and X2≥0

Complete Model:
Maximize Z=250X1+400X2
Subject to
2X1+5X2≤200
4X1+2X2≤240
X1 and X2≥0

Graphical Method for Solving LP Problems:

This method is suitable for the problems where the number of variables is only two.

Example 2:
Solve the following LP problem, using Graphical Method.
Maximize Z=6X1+8X2
Subject to
5X1+10X2≤60
4X1+4X2≤40
X1 and X2≥0
Solution:
To compute the coordinates on X1X2 plane, let, 5X1+10X2=60
If X1=0, X2=6
If X2=0, X1=12
For second constraint, let, 4X1+4X2=40
If X1=0, X2=10
If X2=0, X1=10
Plotting the constraints, we get the following figure.

A.N.M. Bazlur Rashid, Assistant Professor (Computer) & Head, Department of Allied Engineering, Bangladesh University of Textiles / Page 5 of 9
 Applications of Computer in Yarn/Fabric/Wet/Apparel/Management Lecture # Project Management

Here, the closed polygon ABCD is the feasible region. The objective function value at each of the corner points
of the closed polygon is computed by substituting its coordinates in the objective function as:
Z(A)=6×0+8×0=0
Z(B)=6×10+8×0=60
Z(C)=6×8+8×2=64
Z(D)=6×0+8×6=48
Hence, the optimal result is Z(C).

Exercise:
• Solve the following LP problem using graphical method. Minimize Z=10x1+15x2+20x3 subject to
2x1+4x2+6x3<=24
3x1+9x2+6x3<=30
x1, x2 and x3>=0

• Solve the following LP problem using graphical method. Maximize Z=5x1+3x2+7x3 subject to
x1+x2+2x3<=22
3x1+2x2+x3<=26
x1+x2+x3<=18
x1, x2 and x3>=0

• Solve the following LP problem using graphical method. Maximize Z=10x1+15x2+20x3 subject to
2x1+4x2+6x3<=24
3x1+9x2+6x3<=30
x1, x2 and x3<=0

A.N.M. Bazlur Rashid, Assistant Professor (Computer) & Head, Department of Allied Engineering, Bangladesh University of Textiles / Page 6 of 9
 Applications of Computer in Yarn/Fabric/Wet/Apparel/Management Lecture # Project Management

Computerized Production Planning and Control

The scope of production planning and control within a company is to plan manufacturing process for control
• the flow of materials
• tools
• work in production (WIP)
Computerized production planning & control (CPPC) systems rely on the data generated by all other areas of
Computer aided engineering (CAE).

Production Planning
It involves a number of activities related to
• the preparation of the manufacturing
• the modification of the manufacturing
• the master production schedule

It includes a number of activities such as

• selecting the most appropriate process
• process planning
• factory layout

Fig. Steps of production planning

Production Control
Production control does not only have to ensure the correct implementation of production planning but must
also provide the means to dynamically change the planning to suit such fluctuations. In a computer-aided
system, the correct and timely delivery of materials can be carried out by automated materials handling
devices.
A.N.M. Bazlur Rashid, Assistant Professor (Computer) & Head, Department of Allied Engineering, Bangladesh University of Textiles / Page 7 of 9
Applications of Computer in Yarn/Fabric/Wet/Apparel/Management Lecture # Project Management

Fig. Steps of materials requirements planning (logical)

Fig. Steps of materials requirements planning operation

A.N.M. Bazlur Rashid, Assistant Professor (Computer) & Head, Department of Allied Engineering, Bangladesh University of Textiles / Page 8 of 9
Applications of Computer in Yarn/Fabric/Wet/Apparel/Management Lecture # Project Management

Fig. Steps of materials requirements planning (physical)

A.N.M. Bazlur Rashid, Assistant Professor (Computer) & Head, Department of Allied Engineering, Bangladesh University of Textiles / Page 9 of 9