A compromise programming for multi-objective task assignment problem

Ngo, S.T. and Jaafar, J. and Aziz, I.A. and Anh, B.N. (2021) A compromise programming for multi-objective task assignment problem. Computers, 10 (2). pp. 1-16. ISSN 2073431X

Full text not available from this repository.
Official URL: https://www.scopus.com/inward/record.uri?eid=2-s2....

Abstract

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. © 2021 by the authors.

Item Type: Article
Additional Information: cited By 19
Depositing User: Mr Ahmad Suhairi UTP
Date Deposited: 10 Nov 2023 03:29
Last Modified: 10 Nov 2023 03:29
URI: https://khub.utp.edu.my/scholars/id/eprint/15210

Actions (login required)

View Item
View Item