Solving Task Assignment Problem Using Branch and Bound Method

Abstract

The main aim of this paper is to present an algorithm of Branch and Bound method for solving task assignment problem. The branch and bound approach is based on divide and conquer method in which large problem is divided into smaller subsets of solutions. Our algorithm calculates lower bounds on solutions to the Task Assignment problem, which is further divided into subsets. Experimental results show that this Branch and Bound method to solve Task Assignment problem shows better results than standard Hungarian Method. A Numerical example is taken to illustrate the solution procedure.

Cite as

Jyoti Arora, & Surbhi Sharma. (2023). Solving Task Assignment Problem Using Branch and Bound Method. Journal of Applied Mathematics and Statistical Analysis, 4(1), 15–21. https://doi.org/10.5281/zenodo.7813430