A Compromise Programming for Multi-Objective Task Assignment Problem

doi:10.3390/computers10020015

A Compromise Programming for Multi-Objective Task Assignment Problem

2021-01-25

0

OA

AI

DOI：10.3390/computers10020015

原文链接

查看原文

摘要

En 中文

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.

A Compromise Programming for Multi-Objective Task Assignment Problem

摘要

AI总结

期刊

机构

引用论文