FCFS first come first serve

SOT shortest processing tim

EDD earlist dew date metho
n job 1 machine STR

Job (in order of arrival Processing time (DDue date (days hence) flow time
A 3 5 3
B 4 6 7
C 2 7 9
D 6 9 15
E 1 2 16
total flow tim 50
avg flow time 10

SOT E 1 2 1
C 2 7 3
A 3 5 6
B 4 6 10
D 6 9 16
tft 36
AVG 7.2

EDD Job (in order of arrival Processing time (DDue date (days hence) flow time
E 1 2 1
A 3 5 4
B 4 6 8
C 2 7 10
D 6 9 16
tft 39
avg 7.8

STR Job (in order of arrival Processing time (DDue date (days hence) STR
E 1 2 1
A 3 5 2
B 4 6 2
C 2 7 5
D 6 9 3
first come first serve
shortest processing time
earlist dew date method

lateness
0
1
2
6
14
23
4.6

0
0
1
4
7
12
2.4

lateness
0
0
2
3
7
12
2.4
n job 2 mahicne johnson rule

operations time on operations time on

machine 1 machine 2
A 3 2
B 6 8
C 5 6
D 7 4

C B D

Machine 1 C-5 B-11 D-18

Machine 2 idle C-11 B19
 if the shortest toime is on the first machine, do first
second machine- do first
tie - do first

A-21
D-23 A-25
rst machine, do first
 Determine the optimum assignment of jobs to worker for the following data

Worker
A B C D
I 8 6 2 4
N*N Jobs II 6 7 11 10
III 3 5 7 6
IV 5 10 12 9

Step 1 row operation

I 6 4 0 2
II 0 1 5 4
III 0 2 4 3
IV 0 5 7 4

step 2 column operation I 6 3 0 0

II 0 0 5 2
III 0 1 4 1
IV 0 4 7 2

if no of row and lines is not equal then operation is not physib

A B C D
I 7 4 0 0
II 0 0 4 1
III 0 1 3 0
IV 0 4 6 1

I C
II B
III D
IV A
llowing data

assignment method

shortest - all

frm uncovered find least

al then operation is not physible

Row/column with single zero

 Cooker
Food 1 2 3 4
Beans 10 5 6 10
Potato 6 2 4 6
Tomato 7 6 5 6
Corn 9 5 4 10

Food
Beans 5 0 1 5
Potato 4 0 4 6
Tomato 2 1 0 1
Corn 5 1 0 6

Food
Beans 4 0 1 4
Potato 3 0 4 5
Tomato 1 1 0 0
Corn 5 1 0 5

Food
Beans 1 0 1 1
Potato 0 0 4 2
Tomato 1 4 3 0
Corn 2 1 0 5

Food
Beans 0 0 1 0
Potato 0 1 5 2
Tomato 1 5 4 0
Corn 2 2 1 5

Food
Beans 0 0 1 0
Potato 0 0 4 2
Tomato 1 4 3 0
Corn 1 1 0 4

Food
Beans 3
Potato 4
Tomato 2
Corn 1
 n job n machine
Machine
A B C D E
I 5 6 4 8 3
Jobs II 6 4 9 8 5
III 4 3 2 5 4
IV 7 2 4 5 3
V 3 6 4 5 5

I 2 3 1 5 0
II 2 0 5 4 1
III 2 1 0 3 2
IV 5 0 2 3 1
V 0 3 1 2 2

I 1 3 0 2 0
II 1 0 4 1 1
III 2 2 0 1 3
IV 4 0 1 0 1
V 0 4 1 0 3

I E 0
II B 4
III C 2
IV D 5
V A 3
 Consider the following data relevant to an MRP lot sizing problem
L4L
EOQ Item cost per uint $25
LTC Set up cost $100
LUC Inventory carrying cost per year 0.208 5.2

Week Net Requirement MRP PAB HC

1 105 105 0 0
2 80 80 0 0
3 130 130 0 0
4 50 50 0 0
5 0 0 0 0
6 200 200 0 0
7 125 125 0 0
8 100 100 0 0
0

Week Net Requirement MRP PAB HC

1 105 444 339 33.9
2 80 259 25.9
3 130 129 12.9
4 50 79 7.9
5 0 79 7.9
6 200 444 323 32.3
7 125 198 19.8
8 100 98 9.8
790 150.4

98.75
D 5135

EOQ 444.4097208658

Week Net Requirement MRP PAB HC

1 105 365 260 26
2 80 180 18
3 130 50 5
4 50 0 0
5 0 0 0
6 200 425 225 22.5
7 125 100 10
8 100 0 0
81.5
 HC SC
1 105 0 100 100
1--2 185 8 100 92
1--3 315 34 100 66
1--4 365 49 100 51
1--5 365 49 100 51
1--6 565 149 100 -49
1--7 690 224 100 -124
1--8 790 294 100 -194
807

Consider the following data relevant to an MRP lot sizing problem

Item cost per uint $25

Set up cost $100
Inventory carrying cost per year 0.208 5.2
Week Net Requirement MRP PAB HC
1 105 105 0 0
2 80 80 0 0
3 130 130 0 0
4 50 50 0 0
5 0 0 0 0
6 200 200 0 0
7 125 125 0 0
8 100 100 0 0
0

Week Net Requirement MRP PAB HC

1 105 444 339 33.9
2 80 259 25.9
3 130 129 12.9
4 50 79 7.9
5 0 79 7.9
6 200 444 323 32.3
7 125 198 19.8
8 100 98 9.8
790 150.4

98.75
D 5135

EOQ 444.4097208658

Week Net Requirement MRP PAB HC

1 105 365 260 26
 2 80 180 18
3 130 50 5
4 50 0 0
5 0 0 0
6 200 425 225 22.5
7 125 100 10
8 100 0 0
81.5

Combination of weeks HC SC Difference

1 105 0 100 100
1--2 185 0 100 100
1--3 315 26 100 74
1--4 365 41 100 59
1--5 365 41 100 59
1--6 565 141 100 -41
1--7 690 216 100 -116
1--8 790 286 100 -186
751

Values of LUC and LTC are coming same

MRP lot sizing problem

$0.10

SU
100
100
100
100
100
100
100
100
800 800

SU
100

100

200 350.4

SU
100 0.1

100

200 281.5
 HC SC
5 0 100 100
5--6 200 20 100 80
5--7 325 45 100 55
5--8 425 75 100 25

MRP lot sizing problem

$0.10
SU
100
100
100
100
0
100
100
100
700 700

SU
100

100

200 350.4

SU
100 0.1
 100

200 281.5

TC UC
100 0.952381
100 0.540541
126 0.4
141 0.386301
141 0.386301 LUC
241 0.426549
316 0.457971
386 0.488608
 Assume that you are the manager of ABC Inc. You have just received an
delivered at start of week 7 of your schedule. Using the following info
must be ordered in multiples of 80 units and all other components are
used only for this particu

Item Lead time On-Hand Components

Robot 2 10 B,G, C(3)
B 1 5 E,F
C 1 20 G(2), H
E 2 4 …….
F 3 8 ……..
G 2 15 ……..
H 1 10 ………

Robot 1 2 3 4
GR
SR
PAB 10 10 10 10
NR
POR1
POR2

B 1 2 3 4
GR
SR
PAB 5 5 5 5
NR
POR1
POR2 25

C 1 2 3 4
GR
SR
PAB 20 20 20 20
NR
POR1
POR2 70

G 1 2 3 4
GR 140
SR
PAB 15 15 15 35
NR 125
POR1 160
POR2 160

E 1 2 3 4
GR 25
SR
PAB 4 4 4
NR 21
POR1 21
POR2 21

F 1 2 3 4
GR 25
SR
PAB 8 8 8
NR 17
POR1 17
POR2 17

H 1 2 3 4
GR 70
SR
PAB 10 10 10
NR 60
POR1 60
POR2 60
C Inc. You have just received an order for 40 units of an industrial robot, which is to be
dule. Using the following information, determine how many units of sub-assembly G
s and all other components are ordered lot-for-lot. Assume that the components are
used only for this particular robot.

5 6 7
40

10 10
30
30
30

5 6 7
30

25
25

5 6 7
90

70
70

5 6 7
30
 5 5 5
30

5 6 7

5 6 7

5 6 7