MINIMASI MAKESPAN PADA PERSOALAN PENJADWALAN ORDERED FLOWSHOP MENGGUNAKAN PSO

The production scheduling problem is in the kind of flowshop with n jobs and m machines, to get the order of the schedule for allocating operations of the jobs to the available machines so as to get the minimum total time for completion of all job or commonly called makespan. This study uses an optimization technique approach with the PSO algorithm to get minimum makespan on the ordered flowhop scheduling problem. The performance of the scheduling algorithm presented is evaluated by testing on a benchmark data set of 240 variations in the combination number of jobs and machines. The minimum measure is obtained as a result of scheduling with PSO, whose process stops at a certain iteration when in the last 10 iterations there is no change in the value of a better makespan. The performance of the PSO algorithm is efficient at regular flow scheduling with the use of the most iterations of 19 iterations and the longest execution time of 28.42 seconds or less than half a minute, namely scheduling instances with the largest number of machines and jobs. In this research, only the analysis of the resulting minimal forward and the time of execution was carried out. Further research can be extended by not only measuring the minimum makespan, such as measuring total flowtime, total tardiness, and others.