UId : 20200433

Name : Park Byeonju

“I keep the promises between Prof.Lee and I.”

Hw8

app.CT.Value = num2str(str2double(app.CTsEditField.Value) + str2double(app.CTsEditField_2.Value) + str2double(app.CTsEditField_3.Value) + str2double(app.CTsEditField_4.Value) + str2double(app.CTsEditField_5.Value) + str2double(app.CTqEditField.Value) + str2double(app.CTqEditField_2.Value) + str2double(app.CTqEditField_3.Value) + str2double(app.CTqEditField_4.Value) + str2double(app.CTqEditField_5.Value));

app.wip.Value = num2str(str2double(app.wipsEditField.Value) + str2double(app.wipsEditField_2.Value) + str2double(app.wipsEditField_3.Value) + str2double(app.wipsEditField_4.Value) + str2double(app.wipsEditField_5.Value) + str2double(app.wipqEditField.Value) + str2double(app.wipqEditField_2.Value) + str2double(app.wipqEditField_3.Value) + str2double(app.wipqEditField_4.Value) + str2double(app.wipqEditField_5.Value));

Hw7

Hw6 - Safety stock-based supply chain planning

Hw5 - Supply chain planning for M-sub

Hw4 - Multi-items maximal flow network planning

OBJ

Min. -x1 – x2 – x3 – x4 – x5

S.T

Hw3 – The shortest path planning

OBJ

S.T

Node: 22 / Edge: 31 / Rank: Node 22

Shortest Path: X3 – X8 – X19 – X29 – X31 (60miunte)

Hw2 – UML diagram for a robot vacuum

Hw1 – RV’s returning mechanism