MEE1024 Operations Research / Module-3 Tutorial Problems / Darla / SMEC / WS2017-18

3.1. Four different jobs can be done on four different machines. The set up and take down time costs
are assumed to be prohibitively high for changeovers. The matrix below gives the cost in rupees
of producing job i on machine j.
Machine
M1 M2 M3 M4
J1 18 26 17 11
J2 13 28 14 26
Job
J3 38 19 18 15
J4 19 26 24 10
How should the jobs be assigned to the various machines so that the total cost is minimized?

3.2. A machine tool company decides to make four subassemblies through four contractors. Each
contactor is to receive only one subassembly. The cost of each subassembly is determined by the
bids submitted by each contractor and is shown in table in hundreds of rupees. Assign the
different subassemblies to contactors so as minimize the total cost.

Contractor
C1 C2 C3 C4
S1 15 13 14 17
S2 11 12 15 13
Subassembly
S3 13 12 10 11
S4 15 17 14 16

3.3. A company has one surplus truck in each of the cities A, B, C, D and E and one deficit truck in
each of the cities 1, 2, 3, 4, 5 and 6. The distance between the cities in kilometers is shown in the
matrix below. Find the assignment of trucks from cities in surplus to cities in deficit so that the
total distance covered by vehicles is minimum.
1 2 3 4 5 6
A 12 10 15 22 18 8
B 10 18 25 15 16 12
C 11 10 3 8 5 9
D 6 14 10 13 13 12
E 8 12 11 7 13 10

3.4.A company has a team of four salesmen and there are four districts where the company wants to
start its business. After taking into account the capabilities of salesman and the nature of districts,
the company estimates that the profit per day in rupees for each salesman in each district is as
below.

Darla / SMBS / VIT Page 1 of 4

 1 2 3 4
A 16 10 14 11
B 14 11 15 15
Sales man C 15 15 13 12
D 13 12 14 15
E 8 12 11 7

3.5. Four new machines M1, M2, M3, M4 and are to be installed in a machine shop. There are five
vacant places A, B, C, D and E available. Because of limited space, machine M2 cannot be placed
at C and M3 cannot be placed at A. Cij, the assignment cost of machine i to place j in rupees is
shown below.
A B C D E
M1 4 6 10 5 6
M2 7 4 - 5 4
M3 - 6 9 6 2
M4 9 3 7 2 3
Find the optimal assignment schedule.

3.6. The job shop company has purchased three new machines of different type. There are four
available locations in the shop where machine could be installed. Some of these locations are
more desirable that others for particular machines because of their proximity to work centers that
will have a heavy work flow to and from these machines. (There will be no work flow between
the new machines.) Therefore, the objective is to assign the new machines to the available
locations to minimize the total cost of materials handling. The estimated cost in rupees per hour
of material handling involving each of the machines is given in table for the respective locations.
Location 2 is not considered suitable for machine 2, so no cost is given for this case.

Location Location 2 Location Location 4

1 3
1 13 16 12 11

2 15 - 13 20
Machine
3 5 7 10 6

Formulate the problem as an assignment model and determine the optimal assignment.

3.7.Klyne’s four children, John, Karen, Joseph and Terri, want to earn some money to take care of
personal expenses during a school trip. Mr. Klyne has chosen four chores for his children:
mowing the lawn, painting the garage door, cleaning the living hall and whasing the family cars.
He asks them to submit secret bids for these chores. All four children will abide by their father’s
decision as to who get which chore. The received bids (Rs.’100) are summarised below:

Darla / SMBS / VIT Page 2 of 4

 Chore
C1 C2 C3 C4
John 1 4 6 3
Karen 9 7 10 9
Joseph 4 5 11 7
Terri 8 7 8 5

Based on this information, how should Mr.Klyne assign the chores in order to minimize his
money?

3.8.There are seven jobs, each of which has to go through the machine A and B in the order AB.
Processing times in hours are given as
Job: 1 2 3 4 5 6 7
Machine A: 3 12 15 6 10 11 9
Machine B: 8 10 10 6 12 1 3
Determine a sequence of these jobs that will minimize the total elapsed time.

3.9. A factory has five jobs, each of which should go through two machines A and B, in the order
AB. Processing time in hours for the jobs are given below.
Job: J1 J2 J3 J4 J5
Machine A: 5 1 9 3 10
Machine B: 2 6 7 8 4
Determine the sequence for performing the jobs that would minimize the total elapsed time.

3.10. Find the sequence that minimizes the total elapsed time required to complete the following
jobs on two machines in the order AB.
Job: 1 2 3 4 5 6
Machine A: 1 3 8 5 6 3
Machine B: 5 6 3 2 2 10

3.11. Find the sequence that minimizes the total elapsed time required to complete the following
tasks on two machines:
Task: A B C D E F G H I
Machine A: 2 5 4 9 6 8 7 5 4
Machine B: 6 8 7 4 3 9 3 8 11

3.12. We have five jobs, each of which must go through machines A, B and C in the order ABC.
Processing times in hours are given below.
Jobs: 1 2 3 4 5
Machine A: 5 7 6 9 5
Machine B: 2 1 4 5 3
Machine C: 3 7 5 6 7
Determine the sequence of the jobs that minimize the total elapsed time.

Darla / SMBS / VIT Page 3 of 4

3.13. Solve the following sequencing problem, giving an optimal solution when passing is not
allowed.
Jobs: A B C D E
Machine M1: 10 12 8 15 16
Machine M2: 3 2 4 1 5
Machine M3: 5 6 4 7 3
Machine M4:14 7 12 8 10

3.14. Determine the optimal sequence of performing 5 jobs on 4 machines. The machining of each
job is required in the order of A - B – C - D and the process timing are as follows.
Machines
A B C D
1 8 3 4 7
2 9 2 5 5
Jobs 3 6 4 5 8
4 12 5 1 9
5 7 1 2 3

3.15. A firm works 40 hours a week and has a capacity of overtime work to the extent of 20 hours
in a week. It has received seven orders to be processed on three machines A, B and C, in the
order A-B-C to be delivered in a week’s time from now. The processing times (in hours) are
recorded in the following table:
Job: 1 2 3 4 5 6 7
Machine A: 7 8 6 6 7 8 5
Machine B: 2 2 1 3 3 2 4
Machine C: 6 5 4 4 2 1 5
The manager, who in fairness insists on performing the jobs in the sequence in which they are
received, is refusing to accept an eighth order, which requires 7, 2 and 5 hours respectively on
A, B and C machines, because according to him the eight jobs would require a total of 61
hours for processing, which exceeds the firm’s capacity. What is your advice to him? Justify
your answer.

3.16. Find the sequence that minimizes the total elapsed time required to complet the following
tasks (in hrs) on series of Machine-I and Machine-II:
Task: A B C D E F G H
Machine-I: 6 2 8 9 9 6 7 6
Machine-II:8 7 3 6 4 10 4 8

Calculate the minimum elapsed time and idle times of machine-I and machine-II. Identify the
task which has to wait more time for machine-II.

3.17. A factory has five jobs, each of which should go through two machine A and B, in the order AB. Processing
time in hours for the jobs are given below.
Job: J1 J2 J3 J4 J5
Machine A: 15 11 19 13 30
Machine B: 12 16 17 18 15
Use Johnson’s rule to determine the optimal sequence for performing the jobs and its elapsed
time. Find the idle time of resources.

Darla / SMBS / VIT Page 4 of 4