Time efficiency and match optimization in scheduling Pencak Silat matches: a case study of the Sleman Regency Student Pencak Silat Championship in 2023

The issue of this research is that many pencak silat matches in Indonesia still use manual calculations in several dis-tricts/regencys, then the calculation data is inputted into the system. This will take a lot of time, so the pencak silat match schedule spends a lot of time. The data used is the number of parties at the Sleman Regency Student Pencak Silat Championship in 2023. This research aims to find calculations to maximize the number of parties/matches/match numbers per day in a martial arts match. The method that can be used is the Preemptive Multiple Bounded Knapsack Problem (PMBKP). PMBKP involves distributing the quanti-ty of different types of items to a group of knapsacks with their respective priorities and capacity limits. The PMBKP results obtained in the 2023 Sleman District Pencak Silat Championship problem using the Branch and Bound algorithm are 175 parties on the first day, 133 parties on the second day, 128 parties on the third day, 127 parties on the fourth day, and 72 parties on the fifth day. These results can be said to be effective if applied to pencak silat matches that aim to nurture achievements, such as introductions and district/regency level matches. Keywords: Pencak Silat, Competition, Sports Schedule