Optimization of fuzzy multi-company workers assignment problem with penalty using genetic algorithm
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 9
Abstract
In this paper, we proposed the fuzzy multi-job and multi-company workers assignment problem with penalty. Our purpose is obtaining the optimal solution the assignment problem, where n jobs are assigned to m workers (m>n), each job must be assigned to one and only one worker and each worker could be received one job or do not receive any job. Furthermore, there are k company where each worker belong a special company. For finding the optimal assignment, we must optimize total cost this problem assignment. This problem has three types of costs, direct cost company cost and penalty. In this paper, first the proposed assignment problem is formulated to the crisp model by using a suitable fuzzy ranking and fuzzy arithmetic operators. Finally, a heuristic genetic algorithm is designed for solving the proposed problem and an example is given to verify the efficiency of the algorithm.
Authors and Affiliations
M. Esmaieli , N. Shahsavari Pour , R. Esmaieli
Keywords
Related Articles
- EP ID EP129650
- DOI -
- Views 100
- Downloads 0
Self-Healing in Dynamic Web Service Composition
Web service composition is defined as an orchestration of multiple web services into a single composite web service. Web service composition is done in three ways such as static web service composition, dynamic web servi...
Model based approach for Detection of Architectural Distortions and Spiculated Masses in Mammograms
This paper investigates detection of Architectural Distortions (AD) and spiculated masses in mammograms based on their physical characteristics. We have followed a model based approach which separates the abnormal patter...
QUALITY OF SERVICE FOR MOBILE AD-HOC WIRELESS NETWORKS
Mobile ad-hoc network (MANET) is a wireless network without infrastructure. Nodes can commutate each other without central infrastructure; because they are self organised and self configurable with easy deployment. To co...
IRIS RECOGNITION BASED ON GAUSSIAN-HERMITE MOMENTS
Iris recognition is accepted as one of the most efficient biometric method. Implementing this method to the practical system requires the special image preprocessing where the iris feature extraction plays a crucial role...
Hamiltonian cycle and TSP: A backtracking approach
Backtracking is one of the strategies to reduce the complexity of a problem. Backtracking mainly useful when there is a no solution by going forward in that direction so we required backtracking from it to reduce the com...