Main Article Content
An assignment problem (AP) is a particular case of a transportation problem, in which the objective is to assign a number of facilities to an equal number of activities at an overall minimum cost, distance, time (or maximum profit). It occupies extremely a major part in the real physical world. The most common method used to solve the APs is the Hungarian method. In this paper, we make an endeavor to introduce a new ones assignment approach namely MASS (Modified Assignment) for finding optimal pattern of assignments to a wide range of APs. 2010 Mathematics Subject Classification: 90C08, 90C10
TURCOMAT publishes articles under the Creative Commons Attribution 4.0 International License (CC BY 4.0). This licensing allows for any use of the work, provided the original author(s) and source are credited, thereby facilitating the free exchange and use of research for the advancement of knowledge.
Detailed Licensing Terms
Attribution (BY): Users must give appropriate credit, provide a link to the license, and indicate if changes were made. Users may do so in any reasonable manner, but not in any way that suggests the licensor endorses them or their use.
No Additional Restrictions: Users may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.