Uid : 20201258

Name : Heo SeongBo

I keep the promise between professor Lee and I

HW.8

Lambda = 5

1row = c

2row = u

3row = cov_s

HW.7

n = 7

1machine : u = 5, r = 2, v(1) = 7

2machine : o = 4, r = 1, v(2) = 10

Maxwip = 4

Uo = 1machine not breakdown

Ux = 1machine breakdown

So = 2machine not breakdown

Sx = 2machine breakdown

wip = 1.7459, wip_q = 1.0519, wip_s = 0.6940

ct = 0.2494, ct_q = 0.1503, ct_s = 0.0991

HW.6

HW.5

HW.4

Node = 16, Edge = 30, Rank = 16

Obj.

Min -x(1)-x(2)-x(3)

s.t.

x(1)+x(2)+x(3) = x(74)+x(75)+x(76)+x(77)+x(78)+x(79)+x(80)+x(81)+x(82)

x(1) = x(5)

x(2) = x(9)

x(3) = x(10)

x(4) = x(13)

x(5)+x(8)+x(11) = x(14)

x(6)+x(9)+x(12) = x(15)

x(7)+x(10)+x(13) = x(16)

x(6) = 0

x(7) = 0

x(8) = 0

x(10) = 0

x(11) = 0

x(12) = 0

x(14) = x(17)+x(20)

x(15) = x(18)+x(21)

x(16) = x(19)+x(22)

x(17) = x(23)+x(26)+x(29)

x(18) = x(24)+x(27)+x(30)

x(19) = x(25)+x(28)+x(31)

x(20) = x(32)+x(35)+x(38)

x(21) = x(33)+x(36)+x(39)

x(22) = x(34)+x(37)+x(40)

x(23)+x(32) = x(41)+x(44)

x(24)+x(33) = x(42)+x(45)

x(25)+x(34) = x(43)+x(46)

x(26)+x(35) = x(47)+x(50)

x(27)+x(36) = x(48)+x(51)

x(28)+x(37) = x(49)+x(52)

x(29)+x(38) = x(53)+x(56)

x(30)+x(39) = x(54)+x(57)

x(31)+x(40) = x(55)+x(58)

x(41)+x(47)+x(53) = x(59)+x(62)

x(42)+x(48)+x(54) = x(60)+x(63)

x(43)+x(49)+x(55) = x(61)+x(64)

x(44)+x(50)+x(56) = x(65)+x(68)

x(45)+x(51)+x(57) = x(66)+x(69)

x(46)+x(52)+x(58) = x(67)+x(70)

x(59) = x(74)

x(60) = x(75)

x(61) = x(76)

x(62)+x(65) = x(71)+x(77)

x(63)+x(66) = x(72)+x(78)

x(64)+x(67) = x(73)+x(79)

x(68)+x(71) = x(80)

x(69)+x(72) = x(81)

x(70)+x(73) = x(82)

HW.3

Node – 22, Edge – 33, rank - 22

optimum

2 > 4 > 8 > 14 > 15> 16 > 18 > 22 > 28 > 33

HW.2

HW.1

Robor vacuum

When thinking about the principle of the robot cleaner returning, it first thinks that its location is coordinate 0, identifies the rest of the area, creates a virtual map, and if the battery drops more than a certain level during cleaning of the original location,

it will return to the location where the coordinate value becomes zero with the optimal flow path. However, in this case, if you go straight to coordinate 0, you cannot guarantee that there will be no obstacles, so you did not simply think about the

coordinates of movement. And the idea is to make them recognize that there is an obstacle to the location in the virtual coordinate if an obstacle is found on a cleaning road on a map, such as a GPS. If you enter obstacles one by one, it may be

difficult to find the location if you use the robot cleaner for the first time, but as you clean more and more, you will be able to get to the original location while avoiding obstacles neatly.