Serial : Gh1_G_ME_Industrial Engineering_310818

Delhi | Noida | Bhopal | Hyderabad | Jaipur | Lucknow | Indore | Pune | Bhubaneswar | Kolkata | Patna
Web: www.madeeasy.in | E-mail: info@madeeasy.in | Ph: 011-45124612

CLASS TEST MECHANICAL

2018-19 ENGINEERING

Subject : Industrial Engineering

Date of test : 31/08/2018

Answer Key

1. (d) 7. (b) 13. (c) 19. (d) 25. (c)

2. (a) 8. (c) 14. (d) 20. (b) 26. (c)

3. (c) 9. (c) 15. (b) 21. (d) 27. (b)

4. (c) 10. (c) 16. (d) 22. (c) 28. (a)

5. (c) 11. (a) 17. (d) 23. (b) 29. (b)

6. (a) 12. (b) 18. (d) 24. (c) 30. (b)

 CT-2018 | ME • Industrial Engineering 7

Detailed Explanations

3. (c)
Standard deviation of critical path a → e is
= 16 + 5 + 7 + 8 = 36 = 6
4. (c)
At the optimal point, annual holding cost is equal to annual ordering cost
Annual inventory cost = Annual holding cost + Annual ordering cost
= 2 × Annual holding cost
Annual holding cost
⇒ = 0.5
Annual inventory cost
5. (c)
2DC0
Optimum value of Q (Q*) = Ch
Optimum number of orders placed per year,
D DCh
N = Q * = 2C
0

Optimum length time between orders

T 2C0 2C0
t = =T or
N DCh DCh
When T (Total time horizon) is one year.
7. (b)
λ = 90/hour
µ = 100/hour
λ 90
ρ = = = 0.9
µ 100
Average length of queue at each counter
ρ2 0.9 × 0.9
= = = 8.1
1− ρ 0.1
8. (c)
Expected number of customer in the system = Ls = Ws × λ
 1   λ 
=  λ =  
µ-λ µ-λ
9. (c)
15
λ = × 60 = 90 customers/ hour
10
10
µ = × 60 = 120 customers/ hour
5
Probability the cashier will be working
90
= = 0.75
120
Probability the cashier will be idle
= 1 – 0.75 = 0.25
10. (c)
Assuming cycle time = 10 minutes

www.madeeasy.in © Copyright :
 8 Mechanical Engineering

Σ ti = 10 + 9 + 7 + 9 + 8 = 43
∑ti 43
Balance delay = 1 − = 1− = 0.14 = 14%
n × tc 5 × 10
11. (a)
According to Johnson rule, the correct order will be
0 6 13 21 33 47 56 66
E-F-B-A-D-C-G
Milling
66
Utilisation of milling M/C = × 100 = 92.95% Drilling
71
64 6 20 29 41 51 59 65 71
Utilisation of drilling M/C = × 100 = 90.14%
71
12. (b)

3
5
2
F, 4
A, 3 D, 4
10
10 E, 4 14
0 4 5
1 14
0
C, 5
B, 5 G, 6
3
5
5

Project duration = 14 days

Critical path = B - C - E
13. (c)
The complete model is given by x2
1

Z = 5x1 + 4x2 6
1=
–x

Subject to 6x1 + 4x2 ≤ 24 5

2
x
6x 1

x1 + 2x2 ≤ 6 4
+4

– x1 + x2 ≤ 1
x 2=

3
x2= 2
24

x2 ≤ 2 2
x1 +
x1, x2 ≥ 0 1 2x
2 =
6
Solving the above problem, we get
x1
x1 = 3, x2 = 1.5 1 2 3 4 5 6

14. (d)
It is evident from the net evaluations of the optimum table that the net evaluation corresponding to non-
basic variable y1 is zero. This is an indication that an alternative basic solution exits. Thus we can bring y1
in to basis in place of y3 or y5. The resulting new basic feasible solution will also be an optimum one.
15. (b)
Maximum station time (Ts ) max = 10 minutes
i
Smoothness index (S.I.)

2
( )
n
= ∑  Tsi max − Tsi  = (10 − 7)2 + (10 − 9)2 + (10 − 7)2 + (10 − 10)2 + (10 − 9)2 + (10 − 6)2
i =1

(S.I.) = 6

www.madeeasy.in © Copyright :
 CT-2018 | ME • Industrial Engineering 9

16. (d)
Using the shortest processing time (SPT) rule, sequencing of jobs is
1 3 2 4

Job t i (Process time) Ci (Job flow time) Due date Tardiness

1 3 3 7 −
3 5 8 4 4
2 6 14 9 5
4 9 23 14 9
Total tardiness = 4 + 5 + 9 = 18
17. (d)
Since the supply and demand is not balanced. Hence the first step is to balance the problem.
19. (d)
TF = LFT – EFT = 58 – 40 = 18
FF = (EFT – EST) – ti j = (40 – 21) – 19 = 0
IF = (Ej – Li) – ti j = (40 – 39) – 19 = –18

IF  18 
Now, FF – = 0 − −  = 1
TF  18 

20. (b)

12 10 10 8 4 2 2 0 3 1 0 0

14
 12 15 11 3
 1 4 0
2 0 2 0
6 10 16 4  = 2 6 12 0 =  1 5 10 0
     
 8 10 9 7   1 3 2 0  0 2 0 0
Min time required =10 + 12 + 4 + 8 = 34.
22. (c)
S1 S2 S3

P 110 120 130

Q 115 140 140

R 125 145 165

Step (I): Subtract the minimum entry in each column from all the entries on that column.
Step (II): Substract minimum entry in each row of job opportunity cost matrix from all the entries of that row.
0 0 0
0 15 5
0 10 20
Step (III): Draw minimum number of horizontal and vertical lines to cover all zeros. This can be done in 2
lines, which is one less than the number of rows (which is 3.) Thus the solution is yet not fixed. Hence go to
step IV.
c
d

15 5

10 20

www.madeeasy.in © Copyright :
 10 Mechanical Engineering

Step (IV): From the uncovered entries, the minimum is 5. Thus substract 5 from all the entries, which are
uncovered. Add 5 at junction of lines. We get the following matrix now, as the revised opportunity cost
matrix.
S1 S2 S3

P 5 0 0

Q 0 10 0

R 0 5 15
Thus final assignment is
Item Supplies Cost
P S2 120
Q S3 140
R S1 125
The minimum cost = 120 + 140 + 125
= Rs. 385
23. (b)

 P − d
Qmax = Q 
 P  Q
d
P = 1000 per month
d = 500 per month
Max. inventory level
Q = 1000
d)
–
 1000 − 500  (P
Qmax = 1000  = 500
 1000 
tp (T – tp )
Derivation:
T
Q = P ⋅ tp = T × d
Qmax = (P – d)tp
tp = Q/P
 P − d
Qmax = Q 
 P 
24. (c)
s1 = 100/unit v1 = 60/unit

F 1000000
BP1 = = = 25000
s − v 100 − 60
s2 = ?
V2 = 60 + 10% of 60 = Rs. 66
F2 = 1000000 + 5% of 1000000 = 1050000
1050000
BP2 =
s2 − v 2
It is given in the problem that BP is constant.
BP1 = BP2
1050000
s2 – v2 =
25000
s2 = v2 + 42
s2 = 66 + 42 = 108
∴ % change in s = 8%

www.madeeasy.in © Copyright :
 CT-2018 | ME • Industrial Engineering 11

25. (c)
At first we convert it in equivalent two machine problem:

Job J1 = M1 + M2 J2 = M2 + M3
A 18 14
B 8 10
C 10 9
D 9 8

Now apply Johnson’s algorithm for 2 machine, we can easily find the sequence.
Johnson’s
Johnson’ s Rule:
• If the minimum is on the J1(M1 + M2) machine process is first.
• If the minimum is on the J2(M2 + M1) machine process it last.
26. (c)

Σ(Dt − Ft ) (800 − 1000) + (1320 − 1000) + (1400 − 1000) 520

Bias = = =
N 3 3
Bias = 173.33 ≈ 174
28. (a)

11
12
6
7
4
8 8
3 13
2 4 13
7 20
1 2 5 8
5 6 20
0 5 2
7 2
0 5 4 3
14
11
18
11

29. (b)
To earn the profit of Rs.400
Number of articles to be sold

F+ Profit 2000 + 400

= = = 600 units
s−v 9−5
and

F 2000
BEP = = = 500 units
s−v 9−5
Margin of safety

sales − salesat BEP 750 − 500

= × 100 = × 100 = 33.3%
sales 750

www.madeeasy.in © Copyright :
 12 Mechanical Engineering

30. (b)
Given D = 50000; S = ` 550; C = (0.40) (P); p = 650; d = 350
The EOQ is computed for each unit price

2DS P
Q* =
C p−d

2 ( 50000 ) 550 650

Q*(20.00) =
(0.40)(20.00) (650 − 350) = 3859.51 CPUs (infeasible)
2 ( 50000 ) 550 650
Q*(19.60) =
(0.40)(19.60) (650 − 350 ) = 3898.70 CPUs (feasible)
2 ( 50000 ) 550 650
Q*(19.40) =
(0.40)(19.40) (650 − 350 ) = 3918.74 CPUs (infeasible)
Q* p −d D
We know, TC = C+ S + (D) P
2 p Q*

3898.70 (650 − 350) 50000

TC(19.60) =
2 650
( 0.40)(19.60) +
3898.70
550 + (50000)19.60

= ` 994107.28

4000 (650 − 350) 50000

TC(19.40) =
2 650
(0.40)(19.40) + 4000 550 + (50000)19.40
= ` 984038.07
The lowest TC is `984038.07 corresponding to the unit price of ` 19.40

„„„„

www.madeeasy.in © Copyright :