Abstract
Assignment problems are a category of transportation tricky and one of the linear programming categories in operations research. The assignment problem is used to find one for one among a group of workers, each of whom specializes in one of a set of jobs. The main goal is to reduce gross cost (or gross time) in accordance with user requirements.This study proposes a novel approach for solving the assignment problem, along with numerical examples that compare the results of the new method's solution to the results of the Hungarian method's answer.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
