DEPARTMENT OF MECHANICAL ENGINEERING

GOVERNMENT ENGINEERING COLLEGE HASSAN-573201

INTERNAL ASSESSMENT TEST -I
Course: OERATIONS RESEARCH Course Code: 17ME81 Program: BE Mechanical Engg.

Sem -VIII Max. Marks: 30 Date:27.05.2020 Time: 9:30 AM to 10:30 AM

Instruction: 1. Answer any THREE full questions PO

Marks CO
Attainment
10 1
Define operations Research and Explain briefly Phases of OR Study. 1

A Company manufactures Radios and calculators. The radios

contributes Rs.10/unit and calculators Rs.15/unit as profit. Each
radio requires 4 diodes and 4 resistors while each calculator
1
requires 10 diodes and 2 resistors. The radio takes 12 min. and the
calculator takes 9.6 min. of time on the company electronic testing
machine. The product manager estimates that 160 hrs. of test time
is available. The firm has 8000 diodes, 3000 resistors in stock.
Formulate the problem as LPP to maximize the profit.

A computer company manufactures Laptops and Desktops which

fetches the profit of Rs.700 and 500/unit. Each unit of Laptop takes
4 hrs. of assembly time & 2 hrs. of testing time while each unit of
Desktop requires 3 hrs. of assembly time & 1 hr. for testing. In a
2 10 1 3
given month the total no. of hrs. available for assembly is 210 hrs. &
for inspection is 90 hrs.. Find how many units of each of the two
types to be produced in such a way that the total profit is maximum.
Solve the problem Graphically.

In a factory there are 6 jobs to perform, each of which should go

through two machines A and B in the order A B. The processing
time estimates (in minutes) for the jobs are given below. Obtain the
sequence for performing the jobs that would minimize the total
elapsed time and also find the idle time of both the machines.
3 10 1 2
Job J1 J2 J3 J4
Machine A 1 3 8 5
Machine B 5 6 3 2
 In a manufacturing process three operations (turning, threading and
knurling) have to be performed on the machines M 1, M2 and M3 in
the order M1M2M3. Obtain the optimal sequence if the processing
time estimates of four jobs on the three machines are as follows.

4 Job M1 M2 10 1 2
J1 3 8
J2 12 6
J3 5 4
J4 2 6

Course Outcomes:

1. Understand the basic components of LPP and Formulate a problem as a Linear

Programming Problem (LPP)

2. To Solve an Linear Programming Problem using graphical method for two variables

3. Understand the Johnson’s algorithm and Sequence of n jobs on 2 machines using the
Johnson’s algorithm and to Compute the total elapsed time and idle time of the machines

4. Sequence the n jobs on 3 machines and to Compute the total elapsed time and idle time of
the machines.