Keywords:-
Keywords:
Multi-Objective Assignment Problem, Weighted Sum Method, Hungarian Method, Optimization. Subject Qualification Code: MSC 90C27, MSC 90B50
Article Content:-
Abstract
This study addresses the Multi-Objective Assignment Problem (MOAP) involving five tasks and six team members with three distinct optimization objectives i.e. minimizing cost, time and risk. The weight sum method is applied to transform the multi-objective into a single objective model, reflecting priority-based preferences. The Hungarian method is used to derive optimal solutions for each priority cases. Result demonstrate that varying priorities significantly impact task allocation patterns and overall efficiency, Offering valuable insights for balanced decision-making in resource management.
References:-
References
1. Winston, L. W. (1991), Operations Research: applications and algorithms, Pws-Kent Publishing Company, Boston.
2. Hillier, S. F. and Lieberman, J. G. (2001), Introduction to Operations Research, 7th ed., McGraw-Hill, Boston.
3. Hillier, S. F. and Hillier, S. M. (2005), Introduction to Management Science: a modeling and case studies approach with spreadsheets, 2nd ed., McGraw-Hill, Boston.
4. Anderson, R. D., Sweeney, J. D., and Williams, A. T. (2000), An Introduction to Management Science: quantitative approaches to decision making, 9th ed., Thomson, New York.
5. Taha, A. H. (1992), Operations Research: an introduction, 5th ed., Macmillan, Basingstoke Hampshire.
6. Barr, R., Glover, F., and Klingman, D. (1977), The alternating basis algorithm for the assignment problem, Mathematical Programming, Vol. 13, No.1, pp. 1-13.
7. Hung, M S. and Rom, W. O (1980), Solving the assignment problem by relaxation, Operations Research, Vol. 28, No. 4, pp. 969-982.
8. Garfinkel, R. S. (1971), An improved algorithm for the bottleneck assignment problem, Operations Research, Vol. 19, No. 7, pp. 1717-1751.
9. Ravindran, A. and Ramaswami, V. (1977), On the bottleneck assignment problem, Journal of Optimization Theory and Applications, Vol. 21, No. 4, pp. 451-458.
10. Geetha, S. and Nair, K. P. K. (1993), A variation of the assignment problem, European Journal of Operational research, Vol. 68, No. 3, pp. 422-426.
11. Tsai, C.-H., Wei, C.-C., and Cheng, C.-L. (1999), multi-objective fuzzy deployment of manpower, International Journal of the Computer, the Internet and Management, Vol. 7, No. 2.
2. Hillier, S. F. and Lieberman, J. G. (2001), Introduction to Operations Research, 7th ed., McGraw-Hill, Boston.
3. Hillier, S. F. and Hillier, S. M. (2005), Introduction to Management Science: a modeling and case studies approach with spreadsheets, 2nd ed., McGraw-Hill, Boston.
4. Anderson, R. D., Sweeney, J. D., and Williams, A. T. (2000), An Introduction to Management Science: quantitative approaches to decision making, 9th ed., Thomson, New York.
5. Taha, A. H. (1992), Operations Research: an introduction, 5th ed., Macmillan, Basingstoke Hampshire.
6. Barr, R., Glover, F., and Klingman, D. (1977), The alternating basis algorithm for the assignment problem, Mathematical Programming, Vol. 13, No.1, pp. 1-13.
7. Hung, M S. and Rom, W. O (1980), Solving the assignment problem by relaxation, Operations Research, Vol. 28, No. 4, pp. 969-982.
8. Garfinkel, R. S. (1971), An improved algorithm for the bottleneck assignment problem, Operations Research, Vol. 19, No. 7, pp. 1717-1751.
9. Ravindran, A. and Ramaswami, V. (1977), On the bottleneck assignment problem, Journal of Optimization Theory and Applications, Vol. 21, No. 4, pp. 451-458.
10. Geetha, S. and Nair, K. P. K. (1993), A variation of the assignment problem, European Journal of Operational research, Vol. 68, No. 3, pp. 422-426.
11. Tsai, C.-H., Wei, C.-C., and Cheng, C.-L. (1999), multi-objective fuzzy deployment of manpower, International Journal of the Computer, the Internet and Management, Vol. 7, No. 2.
Downloads
Citation Tools
How to Cite
Dubey, S., & Tenguria, A. (2025). A Multi-Objective Assignment Problem Model to Optimize Task Allocation with the Help of Weight Sum Method. International Journal Of Mathematics And Computer Research, 13(10), 5781-5786. https://doi.org/10.47191/ijmcr/v13i10.12