Assignment problem of a legal firm in Kumasi, Ghana

Boah, Douglas Kwasi; Adu, Isaac Kwasi; Gyebil, Francis Julius

doi:10.12988/ijco.2015.41226

Cited by 8 publications

(3 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A cost table is connected with each assignment problem [4,18]. In general, the row comprises the objects or people we wish to assign, and the column comprises the jobs or tasks we want them assigned to.…”

Section: Mathematical Formulation Of Assignment Problemmentioning

confidence: 99%

Novel Method for Solving Balance and Unbalance Assignment Problem Using New Approach for Ant Colony Algorithm

B.¹

2021

MMA

View full text Add to dashboard Cite

Assignment Problem (AP) is the fundamental application of TP studied in the area of Operations research. The AP is also an essential problem in the field of optimization, where the goal is to optimize production time or cost by allocating one task to one machine, one machine to one job, one destination to one source, or one source to one destination. Various solutions for resolving the assignment problem have been offered in the literature. Excellent response to task problems is obtained using the Hungarian technique. In this study, however, we are discussing a novel alternative strategy that is the almost best performance. Here, we are looking at another technique to resolve algorithm and solution steps AP. In addition, we present an innovative alternative strategy that provides the best performance of APs by utilizing a modified ant colony optimization (ACO) algorithm. A few revisions to the ant colony algorithm (Transition Rule and Pheromone Update Rule) are created, resulting in a solution that is extremely close to the ideal solution. This method is also to be noticed that, requires the least number of steps to reach optimality as compare the obtained results with other well-known meta-heuristic algorithms. Finally, a numerical example is provided to demonstrate this procedure.

show abstract

Section: Mathematical Formulation Of Assignment Problemmentioning

confidence: 99%

Novel Method for Solving Balance and Unbalance Assignment Problem Using New Approach for Ant Colony Algorithm

B.¹

2021

MMA

View full text Add to dashboard Cite

show abstract

“…The assignment problem is a useful tool that is accepted and widely used all over the world for addressing problems in real life. It may be used to assign tasks to machines, operators to machines, salespeople to territories, workers to supervisors, courses to lectures, and engineers to building sites, among other things, with the goal of minimizing or maximizing depending on the kind of problem [4][5][6][7][8].…”

Section: Introductionmentioning

confidence: 99%

A new Application of Assignment Problems Using Three Techniques with it Comparison

Sadiq,

Mohammedali,

Sabri

2022

J. Al-Qadisiyah Comp. Sci. Math.

View full text Add to dashboard Cite

The assignment models are one of the effective operations research techniques for enhancing the educational process and obtaining the desired learning outcomes. Universities organize the criteria for distributing accepted students in accordance with the central admission plan issued by the Ministry of Higher Education to their departments based on of the student’s qualifications represented in the total of his grades in the general examinations for secondary studies as a criterion that qualifies him to compete with other students, in addition to the student’s choices and the department plan. In this paper, we discuss the assignment problem (AP) in the allocation of students to college departments depending on the degree of comparison. Three techniques of assignment problem were used, namely; the Hungarian technique, the Alternative technique, and the new technique presented by Haleemah Jawad Kadhim in 2021, to find the best allocation

show abstract

“…It arises in a variety of decision-making situations. A distinguishing feature of the personnel assignment problem is that one worker is assigned to one and only one task [1]. In general, the assignment problem includes n tasks that must be assigned to n workers where each worker has different competencies in completing each task [8].…”

Section: Introductionmentioning

confidence: 99%

Optimization of Personnel Assignment Problem Based on Traveling Time by Using Hungarian Methods: Case Study on the Central Post Office Bandung

Supian

Wahyuni

Nahar

et al. 2018

IOP Conf. Ser.: Mater. Sci. Eng.

View full text Add to dashboard Cite

Abstract. In this paper, traveling time workers from the central post office Bandung in delivering the package to the destination location was optimized by using Hungarian method. Sensitivity analysis against data changes that may occur was also conducted. The sampled data in this study are 10 workers who will be assigned to deliver mail package to 10 post office delivery centers in Bandung that is Cikutra, Padalarang, Ujung Berung, Dayeuh Kolot, AsiaAfrica, Soreang, Situ Saeur, Cimahi, Cipedes and Cikeruh. The result of this research is optimal traveling time from 10 workers to 10 destination locations. The optimal traveling time required by the workers is 387 minutes to reach the destination. Based on this result, manager of the central post office Bandung can make optimal decisions to assign tasks to their workers.

show abstract

Assignment problem of a legal firm in Kumasi, Ghana

Cited by 8 publications

References 2 publications

Novel Method for Solving Balance and Unbalance Assignment Problem Using New Approach for Ant Colony Algorithm

Novel Method for Solving Balance and Unbalance Assignment Problem Using New Approach for Ant Colony Algorithm

A new Application of Assignment Problems Using Three Techniques with it Comparison

Optimization of Personnel Assignment Problem Based on Traveling Time by Using Hungarian Methods: Case Study on the Central Post Office Bandung

Contact Info

Product

Resources

About