{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:19:03Z","timestamp":1775470743693,"version":"3.50.1"},"reference-count":36,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2021,1,25]],"date-time":"2021-01-25T00:00:00Z","timestamp":1611532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"FPT University","award":["DHFPT\/2020\/12"],"award-info":[{"award-number":["DHFPT\/2020\/12"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers"],"abstract":"<jats:p>The problem of scheduling is an area that has attracted a lot of attention from researchers for many years. Its goal is to optimize resources in the system. The lecturer\u2019s assigning task is an example of the timetabling problem, a class of scheduling. This study introduces a mathematical model to assign constrained tasks (the time and required skills) to university lecturers. Our model is capable of generating a calendar that maximizes faculty expectations. The formulated problem is in the form of a multi-objective problem that requires the trade-off between two or more conflicting objectives to indicate the optimal solution. We use the compromise programming approach to the multi-objective problem to solve this. We then proposed the new version of the Genetic Algorithm to solve the introduced model. Finally, we tested the model and algorithm with real scheduling data, including 139 sections of 17 subjects to 27 lecturers in 10 timeslots. Finally, a web application supports the decision-maker to visualize and manipulate the obtained results.<\/jats:p>","DOI":"10.3390\/computers10020015","type":"journal-article","created":{"date-parts":[[2021,1,25]],"date-time":"2021-01-25T09:59:40Z","timestamp":1611568780000},"page":"15","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["A Compromise Programming for Multi-Objective Task Assignment Problem"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4098-3147","authenticated-orcid":false,"given":"Son Tung","family":"Ngo","sequence":"first","affiliation":[{"name":"Center for Research in Data Science, Department of Computer and Information Sciences, Universiti Teknologi PETRONAS, Tronoh 32610, Malaysia"},{"name":"Information and Communication Technology Department, FPT University, Hanoi 100000, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jafreezal","family":"Jaafar","sequence":"additional","affiliation":[{"name":"Center for Research in Data Science, Department of Computer and Information Sciences, Universiti Teknologi PETRONAS, Tronoh 32610, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2654-4463","authenticated-orcid":false,"given":"Izzatdin Abdul","family":"Aziz","sequence":"additional","affiliation":[{"name":"Center for Research in Data Science, Department of Computer and Information Sciences, Universiti Teknologi PETRONAS, Tronoh 32610, Malaysia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3532-9434","authenticated-orcid":false,"given":"Bui Ngoc","family":"Anh","sequence":"additional","affiliation":[{"name":"Information and Communication Technology Department, FPT University, Hanoi 100000, Vietnam"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,1,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"e3421","DOI":"10.1590\/0104-530x3241-19","article-title":"Optimization in timetabling in schools using a mathematical model, local search and Iterated Local Search procedures","volume":"26","author":"Andrade","year":"2019","journal-title":"Gest\u00e3o Produ\u00e7\u00e3o"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Lemos, A., Melo, F.S., Monteiro, P.T., and Lynce, I. (2018). Room usage optimization in timetabling: A case study at Universidade de Lisboa. Oper. Res. Perspect., 100092.","DOI":"10.1016\/j.orp.2018.100092"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.cie.2017.07.034","article-title":"Training offer selection and course timetabling for remedial education","volume":"111","author":"Ghiani","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.ejor.2015.11.028","article-title":"Developing compact course timetables with optimized student flows","volume":"251","author":"Vermuyten","year":"2016","journal-title":"Eur. J. Oper. Res."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.cie.2014.11.010","article-title":"A survey of approaches for university course timetabling problem","volume":"86","author":"Babaei","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1016\/j.ejor.2005.09.014","article-title":"Assignment problems: A golden anniversary survey","volume":"176","author":"Pentico","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0377-2217(03)00103-6","article-title":"An integer programming formulation for a case study in university timetabling","volume":"153","author":"Daskalaki","year":"2004","journal-title":"Eur. J. Oper. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556788.2016.1233970","article-title":"An integer program and a hybrid genetic algorithm for the university timetabling problem","volume":"32","author":"Feng","year":"2016","journal-title":"Optim. Methods Softw."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Silhavy, R., Senkerik, R., Oplatkova, Z., Silhavy, P., and Prokopova, Z. (2016). MATP: A Multi-agent Model for the University Timetabling Problem. Software Engineering Perspectives and Application in Intelligent Systems, Springer. Advances in Intelligent Systems and Computing.","DOI":"10.1007\/978-3-319-33622-0"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Nouri, H.E., and Driss, O.B. (2013, January 20\u201322). Distributed model for university course timetabling problem. Proceedings of the 2013 International Conference on Computer Applications Technology (ICCAT), Sousse, Tunisia.","DOI":"10.1109\/ICCAT.2013.6521990"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Malik, B.B., and Nordin, S.Z. (2017, January 27\u201329). Mathematical model for timetabling problem in maximizing the preference level. In Proceeding of the 25th National Symposium on Mathematical Sciences (Sksm25): Mathematical Sciences as the Core of Intellectual Excellence, Pahang, Malaysia. AIP Conference Proceedings.","DOI":"10.1063\/1.5041568"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10479-010-0709-y","article-title":"Strong bounds with cut and column generation for class-teacher timetabling","volume":"194","author":"Santos","year":"2012","journal-title":"Ann. Oper. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.cor.2014.06.023","article-title":"A fix-and-optimize heuristic for the high school timetabling problem","volume":"52","author":"Dorneles","year":"2014","journal-title":"Comput. Oper. Res."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Hmer, A., and Mouhoub, M. (2010). Teaching Assignment Problem Solver. Lect. Notes Comput. Sci., 298\u2013307.","DOI":"10.1007\/978-3-642-13025-0_32"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The Hungarian method for the assignment problem","volume":"2","author":"Kuhn","year":"1955","journal-title":"Nav. Res. Logist. Q."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","article-title":"A multiplier adjustment method for the generalized assignment problem","volume":"32","author":"Fisher","year":"1986","journal-title":"Manag. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s00291-007-0097-0","article-title":"A survey of metaheuristic-based techniques for University Timetabling problems","volume":"30","author":"Lewis","year":"2007","journal-title":"OR Spectr."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Muthuraman, S., and Venkatesan, V.P. (2017, January 2\u20134). A Comprehensive Study on Hybrid Meta-Heuristic Approaches Used for Solving Combinatorial Optimization Problems. Proceedings of the 2017 World Congress on Computing and Communication Technologies (WCCCT), Tiruchirappalli, India.","DOI":"10.1109\/WCCCT.2016.53"},{"key":"ref_19","unstructured":"Sigl, B., Golub, M., and Mornar, V. (2003, January 19). Solving timetable scheduling problem using genetic algorithms. Proceedings of the 25th International Conference on Information Technology Interfaces (ITI 2003), Cavtat, Croatia."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"267","DOI":"10.55630\/sjc.2008.2.267-276","article-title":"Genetic algorithm approach for solving the task assignment problem","volume":"2","author":"Kratica","year":"2008","journal-title":"Serdica J. Comput."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Sapru, V., Reddy, K., and Sivaselvan, B. (2010, January 28\u201329). Time table scheduling using Genetic Algorithms employing guided mutation. Proceedings of the 2010 IEEE International Conference on Computational Intelligence and Computing Research, Coimbatore, India.","DOI":"10.1109\/ICCIC.2010.5705788"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TSMCC.2010.2049200","article-title":"Genetic algorithms with guided and local search strategies for university course timetabling","volume":"41","author":"Yang","year":"2011","journal-title":"Syst. Man Cybern. Part C Appl. Rev."},{"key":"ref_23","first-page":"219","article-title":"Evolving timetables","volume":"Volume 1","author":"Chambers","year":"1995","journal-title":"The Practical Handbook of Genetic Algorithms"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Hwang, C.-L., and Masud, A.S.M. (1979). Multiple Objective Decision Making, Methods and Applications: A State-of-the-Art Survey, Springer.","DOI":"10.1007\/978-3-642-45511-7"},{"key":"ref_25","unstructured":"Cochrane, J.L., and Zeleny, M. (1973). Compromise Programming. Multiple Criteria Decision Making, University of South Carolina Press."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Son, N.T., Thanh, L.V., Duong, T.B., and Anh, B.N. (2018). A decision support tool for cross-functional team selection: Case study in ACM-ICPC team selection. Proceedings of the 2018 International Conference on Information Management & Management Science (IMMS\u201818), ACM.","DOI":"10.1145\/3277139.3277149"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Son, N.T., Thuy, T.T., Anh, B.N., and van Dinh, T. (2019). DCA-Based Algorithm for Cross-Functional Team Selection. Proceedings of the 2019 8th International Conference on Software and Computer Applications (ICSCA\u201819), ACM.","DOI":"10.1145\/3316615.3316645"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Ngo, T.S., Bui, N.A., Tran, T.T., Le, P.C., Bui, D.C., Nguyen, T.D., Phan, L.D., Kieu, Q.T., Nguyen, B.S., and Tran, S.N. (2020). Some Algorithms to Solve a Bi-Objectives Problem for Team Selection. Appl. Sci., 10.","DOI":"10.3390\/app10082700"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1007\/s00500-019-04549-4","article-title":"Application of the TOPS\u0130S method to improve software efficiency and to optimize its management","volume":"24","author":"Mahmudova","year":"2020","journal-title":"Soft Comput."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1027193","DOI":"10.1155\/2018\/1027193","article-title":"Multiobjective Collective Decision Optimization Algorithm for Economic Emission Dispatch Problem","volume":"2018","author":"Xu","year":"2018","journal-title":"Complexity"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Wei, W., and Tian, Z.-Y. (2017). An improved multi-objective optimization method based on adaptive mutation particle swarm optimization and fuzzy statistics algorithm. J. Stat. Comput. Simul., 1\u201314.","DOI":"10.1080\/00949655.2017.1360298"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1162\/106365600568158","article-title":"Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art","volume":"8","author":"Lamont","year":"2000","journal-title":"Evol. Comput."},{"key":"ref_33","unstructured":"Thede, S.M. (2004). An Introduction to Genetic Algorithms. J. Comput. Sci. Coll., 20."},{"key":"ref_34","first-page":"193","article-title":"Genetic Algorithms, Tournament Selection, and the Effects of Noise","volume":"9","author":"Miller","year":"1995","journal-title":"Complex Syst."},{"key":"ref_35","first-page":"49","article-title":"A comparative study of adaptive crossover operators for genetic algorithms to resolve the travelling salesman problem","volume":"31","author":"Otman","year":"2011","journal-title":"Int. J. Comput. Appl."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n5\/2 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."}],"container-title":["Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-431X\/10\/2\/15\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:15:03Z","timestamp":1760159703000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-431X\/10\/2\/15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,25]]},"references-count":36,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2021,2]]}},"alternative-id":["computers10020015"],"URL":"https:\/\/doi.org\/10.3390\/computers10020015","relation":{},"ISSN":["2073-431X"],"issn-type":[{"value":"2073-431X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,25]]}}}