UID : 20221200

Name : InYeong Choi

"I keep the promises between Prof.Lee and I"

_________________________________________________________________________

[과제8]

<MES program>

_________________________________________________________________________

[과제7]

<CONWIP>

28P0 = 5P11 + 4P13

7P0 + 4P21 + 7P12 = 14P11

7P0 + 2P11 = 14P12

7P0 + 10P14 + 5P21 = 12P13

7P0 + P13 = 17P14

7P11 + 7P13 + 17P22 + 9P31 = 19P21

7P12 + 7P14 + 3P21 = 24P22

7P21 + 9P41 + 17P32 = 19P31

7P22 + 3P31 = 24P32

7P31+ 17P42 = 12P41

7P32 + 3P41 = 17P42

_________________________________________________________________________

[과제6]

<Supply Chain Planning M-sub : Safety stock>

_________________________________________________________________________

[과제5]

<Supply Chain Planning M-sub>

_________________________________________________________________________

[과제4]

<Maximal flow network>

Obj :

-X1-X2-X3-X4-X5

S.T. :

X1+X2+X3+X4+X5 = X51+X52+X53+X54+X55+X56+X57+X58+X59

X1+X2 = X6+X7+X8

X3 = X9+X10+X11+X12+X13+X14

X4+X5 = X15+X16+X17

X18+X19+X20 = X33+X34+X35+X36+X37+X38

X21+X22+X23+X24+X25+X26 = X39+X40+X41+X42+X43+X44

X27+X28+X29 = X45+X46+X47

X30+X31+X32 = X48+X49+X50

X33+X34+X35+X39+X40+X41 = X51+X52+X53

X45+X46+X47+X48+X49+X50 = X54+X55+X56

X36+X37+X38+X42+X43+X44 = X57+X58+X59

X1 = X51+X54+X57

X1 = X6

X6+X9 = X18+X21

X12+X15 = X24+X27+X30

X18 = X33+X36

X21+X24 = X39+X42

X27 = X45

X30 = X48

X33+X39 = X51

X45+X48 = X54

X36+X42 = X57

X2 = X52+X55+X58

X2 = X7

X3 = X10+X13

X4 = X16

X7+X10 = X19+X22

X13+X16 = X25+X28+X31

X19 = X34+X37

X22+X25 = X40+X43

X28 = X46

X31 = X49

X34+X40 = X52

X46+X49 = X55

X37+X43 = X58

X5 = X53+X56+X59

X5 = X17

X8+X11 = X20+X23

X14+X17 = X26+X29+X32

X20 = X35+X38

X23+X26 = X41+X44

X29 = X47

X32 = X50

X35+X41 = X53

X47+X50 = X56

X38+X44 = X59

X1≤100, X2≤75, X3≤100, X4≤75, X5≤100, X6≤80, X7≤55, X8≤30, X9≤25, X10≤85, X11≤50, X12≤30, X13≤45, X14≤70, X15≤65, X16≤60, X17≤95, X18≤95, X19≤70, X20≤65, X21≤55, X22≤35, X23≤70, X24≤35, X25≤45, X26≤55, X27≤55, X28≤80, X29≤85, X30≤90, X31≤50, X32≤50, X33≤65, X34≤90, X35≤95, X36≤90, X37≤20, X38≤30, X39≤40, X40≤65, X41≤15, X42≤80, X43≤75, X44≤50, X45≤45, X46≤35, X47≤70, X48≤35, X49≤70, X50≤75, X51≤85, X52≤50, X53≤75, X54≤80, X55≤70, X56≤45, X57≤95, X58≤40, X59≤90

_________________________________________________________________________

[과제3]

<The Shortest Path Planning>

Obj :

9*x1 + 8*x2 + 6*x3 + 7*x4+ 18*x5 + 42*x6 + 26*x7 + 50*x8 + 52*x9 + 111*x10 +

50*x11 + 113*x12 + 51*x13 + 108*x14 + 47*x15 + 54*x16 + 61*x17 + 59*x18 + 18*x19

+ 108*x20 + 91*x21 + 83*x22 + 29*x23 + 81*x24 + 65*x25 + 115*x26 + 11*x27 +

44*x28 + 57*x29 + 58*x30 + 16*x31 + 25*x32 + 6*x33 + 7*x34 + 22*x35 + 15*x36

S.T. :

x1 + x2 + x3 + x4 + x5 + x6 = 1

x1 = x7 + x8 + x9

x2 = x10 + x11

x3 = x12 + x13

x4 = x14 + x15

x5 = x16 + x17

x6 = x18 + x19

x7 = x20

x8 = x21

x9 = x22

x10 + x12 + x14 = x23

x11 + x13 + x15 = x24

x16 + x18 = x25 + x26

x17 + x19 = x27 + x28

x25 + x27 = x29 + x30

x26 + x28 = x31 + x32

x20 + x21 + x22 = x33

x23 + x24 = x34

x29 + x31 = x35

x30 + x32 = x36

x33 + x34 + x35 + x36 = 1

최적해 : 4 >> 15 >> 24 >> 34

x4 + x15 + x24 + x34 = 142

**142km가 최단거리**

_________________________________________________________________________

[과제2]

<로봇 청소기 UML Diagram>

_________________________________________________________________________

[과제1]

<로봇 청소기의 자동 충전으로 돌아가는 방법은 무엇입니까>

로봇 청소기는 충전대에 위치한 여러 발진기에서 출력되는 적외선 신호를 수신하고,

수신된 서로 다른 코드의 적외선 신호를 분석하고, 로봇 청소기의 현재 위치와 각도를

빠르게 추론하여 자동으로 충전대로 돌아갑니다.