Working Paper Article Version 1 This version is not peer-reviewed

A Decision Support Tool for Teacher Assignment Problem

Version 1 : Received: 8 August 2020 / Approved: 9 August 2020 / Online: 9 August 2020 (22:05:13 CEST)
Version 2 : Received: 29 August 2020 / Approved: 31 August 2020 / Online: 31 August 2020 (07:57:53 CEST)

How to cite: Ngo, T.S.; Bui, N.A.; Jafreezal, J. A Decision Support Tool for Teacher Assignment Problem. Preprints 2020, 2020080226 Ngo, T.S.; Bui, N.A.; Jafreezal, J. A Decision Support Tool for Teacher Assignment Problem. Preprints 2020, 2020080226

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 assigning task to the lecturer is an example of the timetabling problem, a class of scheduling. In this study, we introduce a mathematical model to assign fixed tasks (the time and required skills to be fixed) 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 optimal makes decisions require the trade-off presence of trade-offs between two or more conflicting objectives. To solve this, we use different approaches to multi-objective programming. We then proposed the installation of the Genetic Algorithm to solve the introduced model. Finally, the model and algorithm tested with real scheduling data collected at the Computing Fundamental Department, FPT University, Hanoi, Vietnam.

Keywords

Timetabling, Task Assignment, MOP, Combinatory Optimization, Compromise Programming, Genetic Algorithm

Subject

Social Sciences, Education

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.