Scribd
Upload
46 views11 pages

Operations Research Project: BY:-Nikhil Malhotra 19021141074

The document describes a sequencing problem to minimize the total time and idle time to produce 7 types of biscuits using 4 machines. It provides the processing times for each biscuit type on each machine. The optimal sequence is determined to be D, C, F, A, B, G, E with a total time of 89 minutes. The idle times for each machine are calculated as 19, 56, 18, and 78.5 minutes respectively.

Uploaded by

Nikhil Malhotra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
46 views11 pages

Operations Research Project: BY:-Nikhil Malhotra 19021141074

The document describes a sequencing problem to minimize the total time and idle time to produce 7 types of biscuits using 4 machines. It provides the processing times for each biscuit type on each machine. The optimal sequence is determined to be D, C, F, A, B, G, E with a total time of 89 minutes. The idle times for each machine are calculated as 19, 56, 18, and 78.5 minutes respectively.

Uploaded by

Nikhil Malhotra
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

OPERATIONS

RESEARCH
PROJECT
BY:-
NIKHIL MALHOTRA
19021141074
Sequencing Problem
Seven biscuit brands of company Britannia are to be made in the
same factory using four machines; Machine 1 for creaming, Machine
2 for mixing, Machine 3 for baking and Machine 4 for packing. The
time required for preparing each pack of biscuit is as following.

2
JOBS
MACHINES A B C D E F G

GOOD MARIE NUTRI MILK NICE


DAY GOLD CHOICE BOURBON TIGER BIKIS TIME
M1 CREAMING 13 8 7 11 9 10 12
M2 MIXING 4 4 5 6 5 5 4
M3 BAKING 11 10 12 11 8 10 9
M4 PACKING 1 1 1.5 2 1 2.5 1.5

*All the times given are in minutes


3
Find the total time elapsed and the
idle time.

4
From the data of the problem, it is observed that
Min {tM1, j} = 7 = {tM1,B} and
Max {tM2, j} = 6 = {tM1,D}

Since the condition of {Min tM1, j ≥ Max tM1, j} is


satisfied ,the given problem can be converted into a 7
jobs and 2 machines ‘G’ and ‘H’ problem.
The processing times of 7 jobs denoted by  TGj
and THj on G & H respectively are as follows

6
A B C D E F G

MACHINE G 28 22 24 28 22 25 25

MACHINE H 16 15 18.5 19 14 17.5 14.5

7
The optimum sequence obtained is as follows

D C F A B G E

8
MACHINES
M1 M2 M3 M4
JOB
SEQUENCE
D 0-11 11-17 17-28 28-30
C 11-18 18-23 28-40 40-41.5
F 18-28 28-33 40-50 50-52.5
A 28-41 41-45 50-61 61-62
B 41-49 49-53 61-71 71-72
G 49-61 61-65 71-80 80-81.5
E 61-70 70-75 80-88 88-89
9
Total time elapsed corresponding to the optimal sequence has
been calculated as shown in the table using individual
processing times given in the original problem

The table shows that the minimum time elapsed is 89 minutes.

10
MACHINES Idle time
M1 (89-70)=19
M2 (89-75)+(11+1+5+8+4+8+5)=56
M3 (89-88)+(17)=18
M4 28+10+9.5+7.5+9+8+6.5=78.5

Hence, the idle time for machines M1, M2, M3 and M4 the
idle times are 19, 56, 18 and 78.5 minutes respectively.

You might also like