Next Article in Journal
A Review of Agent-Based Programming for Multi-Agent Systems
Previous Article in Journal
Acknowledgment to Reviewers of Computers in 2020
Open AccessArticle

A Compromise Programming for Multi-Objective Task Assignment Problem

1
Center for Research in Data Science, Department of Computer and Information Sciences, Universiti Teknologi PETRONAS, Tronoh 32610, Malaysia
2
Information and Communication Technology Department, FPT University, Hanoi 100000, Vietnam
*
Author to whom correspondence should be addressed.
Computers 2021, 10(2), 15; https://doi.org/10.3390/computers10020015
Received: 14 December 2020 / Revised: 19 January 2021 / Accepted: 20 January 2021 / Published: 25 January 2021
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’s 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. View Full-Text
Keywords: timetabling; task assignment; MOP; combinatory optimization; compromise programming; genetic algorithm timetabling; task assignment; MOP; combinatory optimization; compromise programming; genetic algorithm
Show Figures

Figure 1

MDPI and ACS Style

Ngo, S.T.; Jaafar, J.; Aziz, I.A.; Anh, B.N. A Compromise Programming for Multi-Objective Task Assignment Problem. Computers 2021, 10, 15. https://0-doi-org.brum.beds.ac.uk/10.3390/computers10020015

AMA Style

Ngo ST, Jaafar J, Aziz IA, Anh BN. A Compromise Programming for Multi-Objective Task Assignment Problem. Computers. 2021; 10(2):15. https://0-doi-org.brum.beds.ac.uk/10.3390/computers10020015

Chicago/Turabian Style

Ngo, Son T.; Jaafar, Jafreezal; Aziz, Izzatdin A.; Anh, Bui N. 2021. "A Compromise Programming for Multi-Objective Task Assignment Problem" Computers 10, no. 2: 15. https://0-doi-org.brum.beds.ac.uk/10.3390/computers10020015

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop