Divided Star Graph Model for Solving Assignment Problem with Centroid Ranking Method

Abstract

This article provided an alternative approach to handling assignment problems by outlining the
Centroid Ranking Method, which divides a star network directly, along with an algorithm and
procedures for solving the issue. The nodes represent jobs and people, while the edges indicate the
cost of allocating them to tasks following the division approach. The approach is to choose the
edge with the lowest cost (costs) and remove it along with any nodes that are connected to it.
Then, remove any additional edges that are related with the nodes.