New Proposed Method for Solving Assignment Problem and Comparative Study with the Existing Methods

Afroz, Humayra Dil; Hossen, Mohammad Anwar

doi:10.9790/5728-1302048488

Cited by 12 publications

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is a case of highly degenerate solution in which instead of 𝐦 + 𝐦 − 𝟏 = 𝟐𝐦 − 𝟏allocations, we have exactly 𝐦 allocations. Here we have the targeted objective that the sum total of all 𝑪 𝒊𝒋 ; 𝒊. 𝒆. 𝒛 = ∑ ∑ 𝑪 𝒊𝒋 (1) 𝒇𝒐𝒓 𝒆𝒂𝒄𝒉 𝒊 𝒕𝒉𝒆𝒓𝒆 𝒊𝒔 𝒆𝒙𝒂𝒄𝒕𝒍𝒚 𝒐𝒏𝒆 𝒋 − 𝒊 , 𝒋 𝒇𝒓𝒐𝒎 𝟏 𝒕𝒐 𝒎 ; 𝒘𝒉𝒆𝒓𝒆 𝒎 ∈ 𝑵, must be minimum.…”

Section: 1) Mathematical Factsmentioning

confidence: 99%

Revisiting assignment problem: A novel approach to optimality

Jha,

Prajapati,

Parikh

2024

Int. J. Stat. Appl. Math.

View full text Add to dashboard Cite

Known since decades, all pursue standard algorithm to arrive at optimal basic feasible solution of assignment problem. Retaining the prime objective of assignment, we like to share what our approaches are that initially searches for a basic feasible solution and attempts to rectify each allocation to its optimal value. We, strongly, are of the opinion that this novel approach possesses logical but faster proceedings to optimality: once on achieving basic feasible solution. We are of the opinion that this new approach, on the basis of its own merits, will be widely accepted in the academic world of the subject.

show abstract

Section: 1) Mathematical Factsmentioning

confidence: 99%

Revisiting assignment problem: A novel approach to optimality

Jha,

Prajapati,

Parikh

2024

Int. J. Stat. Appl. Math.

View full text Add to dashboard Cite

show abstract

“…More recently, in 2016, Amponsah, Otoo, and Quayson modified the Hungarian method, focusing on the reduction of computer processing times, by adding new restrictions through penalties. (Amponsah et al, 2016) and (Afroz & Hossen, 2017) presented another modification while evaluating it against other methods.…”

Section: 𝑚𝑖𝑛 ∑ ∑ 𝑐mentioning

confidence: 99%

A Proposal of a simulation-optimization methodology for allocation of agencies with human resources on hexagonal tessellation

Rios-Esparza

Segura-Pérez²

2023

JART

View full text Add to dashboard Cite

The human resource assignment usually considers the search, qualification, selection, and allocation of human resources commonly based on their experience and professional development into different areas of a company. Rarely, the residence location and other characteristics of the personnel are considered.This paper takes a real case allocation problem from a public university social service program in Mexico City where the assignment process is restarted every six months. The lack of consideration of the personnel physical and functional attributes, led to an inefficient allocation process, increasing desertion of the program. To solve this problem, we propose a new methodology built on hexagonal tessellation capable of allocating personnel based on distance, schedules, and skills, which is later improved using simulation, reducing total travel distance in 585 km, improving matching schedules in 26%, matching skills in 37% and reduced the time dedicated to the allocation process from 5 days to 90 minutes.

show abstract

“…Many previous studies on assignment problems have been conducted, including a new technique for determining the optimal solution to assignment problems with maximization objective functions [17]. The assignment problem is a subset of linear programming [18,19,20,21,22]. The One to One Fixed Method will be used in this study to determine optimal solutions in learning outcomes.…”

Section: Introductionmentioning

confidence: 99%

Determining Optimal Solutions in Learning Outcome Using One to One Fixed Method

Wulan¹,

Jamaluddin²,

Ramadhan³

2021

Proceedings of the International Conference on Science and Engineering (ICSE-UIN-SUKA 2021)

View full text Add to dashboard Cite

General assignment problems include n tasks that must be assigned to m workers where each worker has different competencies in completing each task. This research discusses the problem of solving minimization case assignments using a new method, namely the One-to-One Fixed Method. Completion of the One-to-One Fixed method starts by seeing whether the data obtained is balanced or not, if not then an additional dummy, if yes then proceed to the next stage, calculate the penalty by subtracting each row and column with the smallest element, and combining the results of subtracting rows and column into one table. Next, count those that are affected by the line 2 times and are added and are not affected by the line minus the smallest cost that is not affected by the line, if you have not found the optimal result then repeat the steps until you find the optimal result. In the problem of assigning the minimization case after using the One to One Fixed method on a 3 × 3 matrix, the total cost to be incurred by the Islamic Higher

show abstract

New Proposed Method for Solving Assignment Problem and Comparative Study with the Existing Methods

Cited by 12 publications

References 3 publications

Revisiting assignment problem: A novel approach to optimality

Revisiting assignment problem: A novel approach to optimality

A Proposal of a simulation-optimization methodology for allocation of agencies with human resources on hexagonal tessellation

Determining Optimal Solutions in Learning Outcome Using One to One Fixed Method

Contact Info

Product

Resources

About