Published 2025-06-11
Keywords
- Hungarian method,
- fuzzy numbers,
- triangular fuzzy numbers,
- crisp numbers,
- branch and bound method of an assignment problem
How to Cite
Copyright (c) 2025 IJCRT Research Journal | UGC Approved and UGC Care Journal | Scopus Indexed Journal Norms

This work is licensed under a Creative Commons Attribution 4.0 International License.
Abstract
The present study develops approaches to solve assignment problems and FUZZY assignment problems using branch and bound methods. Assignment problem is a fundamental optimization problem in which tasks must be assigned to resources in such a way that the total cost or time is minimized or the total profit is maximized. Fuzzy assignment problems where the profit is not deterministic number but imprecise one. The profit matrix of the assignment problem are triangular fuzzy numbers, and optimal solution can be obtained using Hungarian algorithm and branch and bound method converting fuzzy numbers into crisp number. The efficiency of the proposed method is illustrated by a numerical example.