<![CDATA[XYZ company produce the various shape of motor spare parts product. The company has threeidentical parallel spot welding machines that use a random method of production scheduling, basedon machine capacity without any sequence of jobs, and only use daily production targets given tooperators. Based on the data, the actual scheduling of the machines has a very large completion timedifference between each machine, or the machine loading is uneven. As a result, the makespanbecomes longer with a value of 440000 seconds (26 days). This research aims to minimize the existingmakespan by giving proposed scheduling, using the suggested algorithm method, which has a smallnumber of iterations and has an optimal result. The method begins with the longest processing timesequence rule which is used as the upper bound for the first iteration, then continued to calculate thelower bound and machine workload. The calculation stops at the 15th iteration because the completiontime value exceeds the lower and upper bound so that the optimal scheduling taken is scheduled inthe 14th iteration with a makespan value of 914412 seconds (16 days). The proposed scheduling canminimize the makespan from the actual schedule by 38%.]]>
Copyrights © 2022
