### International Journal of Mathematical, Engineering and Management Sciences

ISSN: 2455-7749

###### Multi-Objective Faculty Course Assignment Problem with Result and Feedback Based Uncertain Preferences

Sunil B. Bhoi
Department of Applied Mathematics and Humanities, Sardar Vallabhbhai National Institute of Technology, Surat, Gujarat, India.

Jayesh M. Dhodiya
Department of Applied Mathematics and Humanities, Sardar Vallabhbhai National Institute of Technology, Surat, Gujarat, India.

;
Accepted on May 17, 2021

Abstract

In this paper, a multi-objective faculty course allocation problem with result analysis and feedback analysis based on uncertain preferences mathematical model is presented. To deal with an uncertain model, three different ranking criteria are being used to develop: a) Expected value, b) Optimistic value, c) Dependent optimistic value criterion. These mathematical models are transformed into their corresponding deterministic forms using the basic concepts of uncertainty theory. The deterministic model of DOCM consists of fractional objectives which are converted into their linear form using Charnes and Cooperâ€™s transformation. These deterministic formulations MOFCAP are converted into a single objective problem by using the fuzzy programming technique with linear and exponential membership functions. Further, the single objective problem for all the defined models is solved in the Lingo 18.0 software to derive the Pareto-optimal solution. The sensitivity of the models is also performed to examine the variation in the objective function due to the variation in parameters. Finally, a numerical example is given to exhibit the application and algorithm of the models.

Keywords- University course scheduling, 0-1 integer programming, Uncertainty theory, Fractional programming, Fuzzy programming approach.

Citation

Bhoi, S. B., & Dhodiya, J. M. (2021). Multi-Objective Faculty Course Assignment Problem with Result and Feedback Based Uncertain Preferences. International Journal of Mathematical, Engineering and Management Sciences, 6(4), 1055-1075. https://doi.org/10.33889/IJMEMS.2021.6.4.062.

Conflict of Interest

The authors confirm that there is no conflict of interest to declare for this publication.

Acknowledgements

This research did not receive any specific grant from funding agencies in the public, commercial, or not-for-profit sectors. The authors would like to thank the editor and anonymous reviewers for their comments that help improve the quality of this work.

References

Abdelhalim, E.A., & El Khayat, G.A. (2016). A utilization-based genetic algorithm for solving the university timetabling problem (UGA). Alexandria Engineering Journal, 55(2), 1395-1409.

Al-Betar, M.A., Khader, A.T., & Zaman, M. (2012). University course timetabling using a hybrid harmony search metaheuristic algorithm. IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews), 42(5), 664-681.

Badri, M.A. (1996). A two-stage multiobjective scheduling model for [faculty-course-time] assignments. European Journal of Operational Research, 94(1), 16-28.

Badri, M.A., Davis, D.L., Davis, D.F., & Hollingsworth, J. (1998). A multi-objective course scheduling model: Combining faculty preferences for courses and times. Computers & Operations Research, 25(4), 303-316.

Bai, R., Burke, E.K., Kendall, G., & McCullum, B. (2006). A simulated annealing hyper-heuristic for university course timetabling problem. Abstract) PATAT, 6.

Bakr, M.A., & Aksop, C. (2008). A 0-1 integer programming approach to a university timetabling problem. Hacettepe Journal of Mathematics and Statistics, 37(1), 41-55.

Bhoi, S.B., & Dhodiya, J.M. (2020). Multi-objective faculty course timeslot assignment problem with result-and feedback-based preferences. In Conference proceeding Ambient Communications and Computer Systems (pp. 105-119). Springer, Singapore.

Costa, D. (1994). A tabu search algorithm for computing an operational timetable. European Journal of Operational Research, 76(1), 98-110.

Csima, J., & Gotlieb, C.C (1964). Tests on a computer method for constructing school timetables. Communications of the ACM, 7(3), 160-163.

Daskalaki, S., & Birbas, T. (2005). Efficient solutions for a university timetabling problem through integer programming. European Journal of Operational Research, 160(1), 106-120.

Gunawan, A., Ng, K.M., & Poh, K.L. (2012). A hybridized Lagrangian relaxation and simulated annealing method for the course timetabling problem. Computers & Operations Research, 39(12), 3074-3088.

Hertz, A. (1991). Tabu search for large scale timetabling problems. European Journal of Operational Research, 54(1), 39-47.

Liu, D.B. (2007). Uncertainty theory. In: Liu, B. (ed) Uncertainty theory. Springer, Berlin, pp. 205-234.

Liu, B. (2009). Some research problems in uncertainty theory. Journal of Uncertain Systems, 3(1), 3-10.

Liu, B., & Chen, X. (2015). Uncertain multiobjective programming and uncertain goal programming. Journal of Uncertainty Analysis and Applications, 3(1), 10. https://doi.org/10.1186/s40467-015-0036-6.

Liu, B., & Liu, B. (2009). Theory and practice of uncertain programming (Vol. 239). Springer, Berlin, Heidelberg.

Najdpour, N., & Feizi-Derakhshi, M.R. (2010). A two-phase evolutionary algorithm for the university course timetabling problem. In 2010 2nd International Conference on Software Technology and Engineering (Vol. 2, pp. 266-271). IEEE. San Juan, PR, USA.

Schniederjans, M.J., & Kim, G.C. (1987). A goal programming model to optimize departmental preference in course assignments. Computers & Operations Research, 14(2), 87-96.

Zimmermann, H.J. (1978). Fuzzy programming and linear programming with several objective functions. Fuzzy Sets and Systems, 1(1), 45-55.