Scribd
Upload
27 views4 pages

MSD Assignment Ii: Spreadsheet Based Manufacturing Systems Analysis

This document describes using the goal chasing algorithm to determine the optimal production sequence for mixed model manufacturing. It involves defining the planned production quantities and operation times for each product, calculating the total necessary quantities of each part, and determining the production sequence that minimizes the squared differences between the cumulative quantities of parts used and the average quantities needed per unit. The algorithm is run iteratively, adding one product to the sequence at each step and recalculating part quantities, until all products are sequenced.

Uploaded by

Vikas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
27 views4 pages

MSD Assignment Ii: Spreadsheet Based Manufacturing Systems Analysis

This document describes using the goal chasing algorithm to determine the optimal production sequence for mixed model manufacturing. It involves defining the planned production quantities and operation times for each product, calculating the total necessary quantities of each part, and determining the production sequence that minimizes the squared differences between the cumulative quantities of parts used and the average quantities needed per unit. The algorithm is run iteratively, adding one product to the sequence at each step and recalculating part quantities, until all products are sequenced.

Uploaded by

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

MSD ASSIGNMENT II: SPREADSHEET BASED MANUF

ANALYSIS:
Mixed Model Sequencing using the Goal
bij
GOAL_1

Qi=planned production quantity of the products(Ai)


Product(Ai, i=1,2,.a)
Ti= operation time per unit of product Ai on the
process l total operation time per day
cycle time=C

A1

Pr
od
uct
s,
Ai

A2
A3

max{sigmaQiTi/sigmQi}

[Nj]=
Q=
[Nj]/Q=

Goal_2

Q=Total production quantity of all products,Ai


Nj=Total necessary quantity of parts aj to be
consumed
for producing
all products
Ai aj to be
Xjk=Total necessary
quantity
of the part
utilized for producing the products of setermined
sequence
from necessary
first to Kth quantity of the part aj
Nj/Q= Average
per unit of a product

Xjk=

K*Nj/Q=Avrage
Dk=sqrt[sum{sqr(k*Nj/Q- Xjk-1
K=k+1
Xjk=Xjk-1 +

bij

-bij)}]

k=
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

BASED MANUFACTURING SYSTEMS

ng using the Goal Chasing algorithm


Parts,aj

Product, Ai

Planned Production
Quantity, Qi

a1

a2

a3

a4

A1

A2

A2

0.5

0.8

0.7

0.5

Xjk-1

bi*j

X1,k

X2,k

X3,k

Q=

10

10

0
0
1
2
2
3
3
3
4
5
5

0
1
2
2
3
4
5
6
6
7
8

X4,k
0

1
1
2
3
3
4
5
6
6
7

Dk,1=

Dk,2=

1.11
0.85
0.82
1.87
1.32
1.64
0.93
0.57
1.56
1.73

1.01
0.57
1.44
1.64
0.87
1.87
1.21
0.85
0.79
1.73

0
0
1
2
2
3
3
3
4
5
5

Dk,3=

Dk,i*=

i*=

0.79
1.59
0.93
0.28
0.87
0.28
0.82
1.59
1.01
0.00

0.79
0.57
0.82
0.28
0.87
0.28
0.82
0.57
0.79
0.00

3
2
1
3
2
3
3
1
2
3

A3
A3
A3
A3
A3
A3
A3
A3
A3
A3

A2
A2
A2
A2
A2
A2
A2
A2
A2

A1
A1
A1
A1
A1
A1
A1
A1

A3
A3
A3
A3
A3
A3
A3

A2
A2
A2
A2
A2
A2

A3
A3
A3
A3
A3

A3
A3 A1
A3 A1 A2
A3 A1 A2 A3

You might also like