This study explores the optimization of non-normal assignments utilizing the Hungarian method for both maximization and minimization. The Hungarian algorithm is a combinatorial optimization technique that efficiently solves assignment problems, ensuring optimal allocation of resources. By applying this method to non-normal assignment scenarios, we aim to demonstrate its effectiveness in enhancing productivity and reducing costs in various industries. The findings indicate that the Hungarian method can significantly improve decision-making processes in complex assignment frameworks, leading to more efficient operations.