A Knowledge-Based Technique for Constraints Satisfaction in Manpower Allocation (original) (raw)
Related papers
A Mathematical Model to Schedule Manpower and Solve using Genetic Algorithm
2016
The staffing schedule according to the objectives of the system and minimizing the cost of production is among the most important factors in productivity. Manpower planning as the means of ensuring the human resources needed to achieve the organization's goals and its mathematical modeling is important for planners. Given that to solve staffing timing issue is very time consuming, in this paper, genetic algorithm is used to solve the proposed model. Therefore, many mathematical models have been used to formulate the scheduling in organizations and through a variety of methods have been tried to solve them. Considering the absence right for the personnel is one of the advantages of the proposed model. Since the cost is regarded as damage, the problem has changed to the cover mode. First, parameters and all restrictions are included with respect to information of the problem and modeling is implemented; then, the problem is solved with genetic algorithm. Finally, results of comput...
Application of Genetic Algorithm to The Job Assignment Problem with Dynamics Constraints
2021
The process of giving out an assignment to an individual that results to delay, or non-performance of the job is from the cause of not evaluating the minimum cost of the work and the right person to perform the assignment. Assignment problem entails assigning a precise person or thing to an exact task or job. The optimal result is to assign one person to one job. The most common method to solve assignment problem is the Hungarian method. In this paper, Genetic Algorithm is applied to solve assignment problems to attain an optimal solution. The “N men – N jobs” issue is the core task issue, where the general expense of tasks is limited as a result of allocating a single job to just an individual. In deciphering this issue, Genetic Algorithm (GA) and Partially Matched Crossover (PMX) are been utilized as an exceptional encoding plan. GA was evaluated alongside the Hungarian method and the results clearly showed that it performed better than the Hungarian method
Solving the Assignment Problem using Genetic Algorithm and Simulated Annealing
International MultiConference of Engineers and Computer Scientists, 2006
The paper attempts to solve the generalized "Assignment problem" through genetic algorithm and simulated annealing. The generalized assignment problem is basically the "N men- N jobs" problem where a single job can be assigned to only one person in such a way that the overall cost of assignment is minimized. While solving this problem through genetic algorithm (GA), a unique
Personnel Scheduling: Comparative Study of Backtracking Approaches and Genetic Algorithms
International Journal of Computer Applications, 2012
Scheduling and timetabling problems are multi-constrained constraint satisfaction problems that have huge search space. These problems are NP hard. This paper investigates the use of backtracking approaches to laboratory personnel scheduling problem in which the objective is to assign tasks to employees. The main objective of this work is to search for better solutions than those obtained by authors using genetic algorithmic approach. The performance of backtracking algorithms is tested for different variable orderings, value ordering and consistency enforcement techniques. It is observed that the variable and value ordering backtracking with consistency enforcement techniques gives better results than the chronological backtracking as well as the results reported in the literature. This work indicates that the problem instance under consideration might have even better solutions which can possibly be obtained by suitably modifying the genetic algorithmic approach used earlier by authors or by using other optimization techniques such as simulated annealing or Tabu search.
Constraint Satisfaction Methods for Solving the Staff Transfer Problem
OPSEARCH, 2005
The Staff Transfer Problem is concerned with the assignment of transfer postings to employees in large organizations. Staff transfers are an important issue in Human Resource Management in countries like India and China that have many large public sector undertakings. The Staff Transfer Problem can be viewed as a Constraint Satisfaction Problem, and methods such as Simulated Annealing, Genetic Algorithms, Satisfiability (GSAT), and Conflict Directed Backjumping can all be employed to solve randomly generated problem instances. Computer experiments indicate that Simulated Annealing is the best method of solution. GSAT with a tabu list yields solutions of good quality but is unable to solve large instances. Genetic Algorithms is also good, but it takes much more time than Simulated Annealing. Conflict Directed Backjumping, a deterministic search technique, is markedly inferior to the other methods. Thus for solving the Staff Transfer Problem, randomized approaches appear to be superior to deterministic ones.
2021
In today’s competitive markets, the role of human resources as a sustainable competitive advantage is undeniable. Reliable hiring decisions for personnel assignation contribute greatly to a firms’ success. The Personnel Assignment Problem (PAP) relies on assigning the right people to the right positions. The solution to the PAP provided in this paper includes the introducing and testing of an algorithm based on a combination of a Fuzzy Inference System (FIS) and a Genetic Algorithm (GA). The evaluation of candidates is based on subjective knowledge and is influenced by uncertainty. A FIS is applied to model experts’ qualitative knowledge and reasoning. Also, a GA is applied for assigning assessed candidates to job vacancies based on their competency and the significance of each position. The proposed algorithm is applied in an Iranian company in the chocolate industry. Thirty-five candidates were evaluated and assigned to three different positions. The results were assessed by ten s...
Scat and Spat: Large-Scale Computer-Based Optimization Systems for the Personnel Assignment Problem
Decision Sciences, 1983
The personnel assignment problem involva the assignment of people to tasks, projects, etc., in a manner that maximizes a measure of aggregate utility for the assignees subject to several assignment constraints. In addition to computationally efficient solution algorithms, the effective implementation of mathematical models to solve the personnel assignment problem must include data processing systems with comprehensive error checking/resolution procedures, end user reports, documentation, and training. This paper summarizes two successful computer-based systems for solving large-scale personnel assignment problems that frequently occur in university settings. SCAT, the Student-Company Assignment Technique, assigns students to job interview slots. SPAT, the Student-Project Assignment Technique, assigns students to project teams in an MBA field project course. The SCAT and SPAT approaches can be generalized to a wide variety of personnel assignment problems in university, industry, government, and military settings.
An Optimizing Approach for Multi Constraints Reassignment Problem of Human Resources
International Journal of Electrical and Computer Engineering (IJECE)
This paper presents an effective approach to optimize the reassignment of Human Resources in the enterprise that is formed by several units of productions to take into consideration the human characteristics. This approach consists of two steps; the first step is to formalize the studied problem that is practically take the form of the generalized assignment problem (GAP) known as NP-hard problem. Additionally, the variables in the formulation of our problem are interlinked by certain constraints. These two proprieties can to justify the important complexity of this problem. The second step is focused to solve this complex problem by using the genetic algorithm. We present the experimentally result for justifying the validity of the proposed approach. So, the solution obtained allowed us to get an optimal assignment of personnel that can lead to improve the average productivity or ratability or at least ensure its equilibration within sites of enterprise.