Pesta Gultom, Ester Sabrina Aruan, Ribka Callista Simangunsong, Viona Anggraini br Ketaren, Winda Rosianna Tampubolon

Application of the Hungarian Assignment Method to Minimize Normal Cases in Cinderella Tempe Chips MSMEs

Introduction

Application of the hungarian assignment method to minimize normal cases in cinderella tempe chips msmes. Optimize production at Cinderella Tempeh Chips MSME using the Hungarian Assignment Method to minimize operational time/cost for processing, frying & packaging. Boost efficiency & competitiveness.

Abstract

Micro, Small, and Medium Enterprises (MSMEs) play a crucial role in the national economy, including the Cinderella Tempeh Chips MSME. To address efficiency and productivity challenges, an appropriate management approach is needed, one of which is the Hungarian minimization method for production assignment. This research explores the application of the Hungarian method to solve minimization assignment problems at the "Cinderella" Tempeh Chips MSME. By transforming production activity data, such as processing, frying, and packaging, into a cost/time matrix, this method aims to minimize the total operational time or cost. The main stages involve row and column reduction to create zero elements, covering zeros with the minimum number of lines, and matrix adjustments until an optimal solution is found. Previous studies in MSMEs, service industries, and warehousing have shown that this method provides significant optimal solutions. The results obtained can help MSMEs improve production efficiency and market competitiveness.

Review

This paper addresses a highly pertinent issue concerning the efficiency and productivity of Micro, Small, and Medium Enterprises (MSMEs), exemplified by the 'Cinderella' Tempeh Chips MSME. Recognizing the critical role these enterprises play in the national economy, the authors propose a structured management approach to tackle operational challenges. Specifically, the research focuses on applying the Hungarian minimization method to solve production assignment problems. The core objective is to minimize the total operational time or cost associated with key production activities, thereby enhancing the overall efficiency of the MSME. The methodology outlined involves a systematic application of the Hungarian method, a well-established algorithm for solving assignment problems. The authors detail the transformation of production activity data—such as processing, frying, and packaging—into a cost or time matrix, which serves as the input for the algorithm. The subsequent stages, including row and column reduction to create zero elements, covering zeros with the minimum number of lines, and iterative matrix adjustments, are standard steps for achieving an optimal solution. This approach is well-suited for discrete assignment problems where resources (e.g., workers, machines) need to be optimally allocated to tasks to minimize a particular metric. The anticipated outcomes of this research hold significant promise for the 'Cinderella' Tempeh Chips MSME and, by extension, for the broader MSME sector. By identifying and implementing optimal assignment strategies, the paper suggests that enterprises can achieve substantial improvements in production efficiency and bolster their market competitiveness. The abstract references previous studies demonstrating the method's effectiveness across various sectors, reinforcing its potential impact here. This work provides a practical demonstration of an operations research technique to address real-world business challenges, potentially serving as a valuable template for other MSMEs grappling with similar efficiency concerns.

Full Text

Comments

You need to be logged in to post a comment.