Publication Search

Micro, Small, and Medium Enterprises (MSMEs) are strategic sectors in the Indonesian economy, but often face challenges in efficient and data-driven production management. This article highlights the urgency of the Real Work Lecture (KKN) program as a form of student service in assisting MSMEs, especially in optimizing the production of snacks typical of Tebing Syahbandar. This research aims to optimize the production output of the Untir-untir Titik Factory with an Integer Linear Programming (ILP) approach using the Branch and Bound algorithm. Primary data is obtained through interviews and production documentation, including product type, raw material needs, operational costs, selling prices, and profit margins. The initial analysis was carried out using the simplex method using POM QM software to obtain a linear solution, which was then refined with the Branch and Bound algorithm so that the results were in the form of integers. The results of the study showed that the optimal solution was achieved by producing 25 bales of kolong-kounder and not producing other types of snacks, resulting in a profit of Rp1,650,000 per day. These findings show that the ILP approach with Branch and Bound is able to significantly increase the efficiency and profitability of MSMEs. In addition, this method can be used as a basis for quantitative-based production decision-making. This research also emphasizes the strategic role of KKN in technology transfer and real solution-based assistance for MSME actors in the region, thereby supporting the sustainable strengthening of the local economy.

This study aims to optimize the cake production profit at Cake by Cece using the Branch and Bound algorithm. The data used include raw material requirements per batch, daily raw material availability, and selling prices for three types of cakes: Cookies, Brownies, and Cinnamon Roll. The optimization model is formulated as an Integer Linear Programming problem with the objective of maximizing total daily profit. The model is solved using the simplex method followed by the Branch and Bound algorithm to obtain valid integer solutions. The results indicate that the optimal production combination is 2 batches of Cookies, 2 batches of Brownies, and 3 batches of Cinnamon Roll, yielding a maximum profit of IDR 233,000 per day. This solution satisfies all raw material constraints and is feasible for daily operational implementation. This study provides quantitative recommendations to support production decision-making in culinary sector MSMEs.

This study presents a Systematic Literature Review (SLR) focusing on the application of the Branch and Bound (B&B) method in production optimization. In modern industry, achieving operational efficiency and profitability is essential, yet optimization often yields fractional solutions that are unrealistic for indivisible entities. The Branch and Bound method, as part of Integer Programming, has proven effective in addressing these constraints by converting fractional solutions into optimal integer values. This SLR analyzed 12 scientific articles published between 2016 and 2024, sourced from databases such as Google Scholar, Scopus, and SINTA. The analysis reveals that B&B is widely utilized to maximize production profit across various sectors, including spring beds, woven fabrics, bread, and furniture, often formulated as Integer Linear Programming (ILP) problems. Furthermore, this method is also applied to minimize production time and determine the shortest routes. Overall, B&B is a flexible and efficient tool that assists companies in managing resources and achieving maximum profit with realistic integer solutions.

CV XXX is one of the micro, small and medium enterprises (MSME) engaged in the food sector, namely bread making. In carrying out its business ventures, CV XXX has a problem, which is not knowing whether the benefits are really maximized or not. The purpose of this study was to find out the effective optimization of the production process and to compare the maximum profit obtained by CV XXX before and after implementing Integer programming using the Branch and Bound method. The data used in this study is primary data obtained from the results of interviews with the CV Langsung Enak Bakery. Based on the results of the study, it was found that in order to optimize the production process effectively in one production run, it is better for CV XXX to produce 76 packs of vanilla chocolate bread, 58 packs of chocolate bread, 66 packs of meses cheese bread, 6 packs of sliced combed bread, 52 packages of torn comb bread, and 614 boxes of white bread, and did not produce 2-flavor bread, 8-flavor bread, chocolate meses bread, round sweet bread, variety comb bread and plain white bread. The maximum profit earned is Rp. 3,024,378 with a total of 872 packaged products and an increase in profits of 13.3% from factual conditions.

CV XXX is one of the micro, small and medium enterprises engaged in the food sector, namely bread making. In carrying out its business ventures, CV XXX has a problem, which is not maximized profits. The purpose of this study was to find out the effective optimization of the production process and to compare the maximum profit obtained by CV XXX before and after implementing Integer programming using the Branch and Bound method. Based on the results of the study, it was found that in order to optimize the production process effectively in one production run, it is better for CV XXX to produce 76 packs of vanilla chocolate bread, 58 packs of chocolate bread, 66 packs of meses cheese bread, 6 packs of sliced ​​combed bread, 52 packages of torn comb bread, and 614 boxes of white bread, and did not produce 2-flavor bread, 8-flavor bread, chocolate meses bread, round sweet bread, variety comb bread and plain white bread. The maximum profit earned is Rp. 3,024,378 with a total of 872 packaged products and an increase in profits of 13.3% from factual conditions.