فهرست نشریات علمی دسترسی آزاد ایران

Optimal resource utilization is a critical measuring parameter in industrial operational activities like assigning numerous workers to machines. The Assignment Problem (AP) is one of the classical linear methodological models that is categorized as a special form of transportation problem in linear programming, procedurally implemented through the Hungarian algorithm. The case firm and the other related stakeholders are still facing challenges and difficulties in making factual decisions in their industrial operational activities, especially in resource allocation, scheduling, and monitoring the progress of their work. Former scholars tried to address the tricks. But, still, there are gaps, especially in terms of linking these roles of assignment algorithms with real cases. This paper presented the procedure, necessity, and aim of the Hungarian algorithmic method. This article aims to analyze assignment activities. After the parameters were identified, the unbalanced matrix of the real case of Metal Workshop was converted into a balanced (square matrix) by adding sufficient imaginary workers or machines. Via this algorithm, the optimal cost per unit was indicated as 18, and the optimized profit from the assignment was indicated as 100. Having the findings and deployed approach, the article forwards a list of recommendations to ensure the long-term competitiveness of the company.