Jáhn-Erdős, Szilvia and Kővári, Bence (2024) Exploring fair scheduling aspects – Through final exam scheduling. POLLACK PERIODICA : AN INTERNATIONAL JOURNAL FOR ENGINEERING AND INFORMATION SCIENCES, 19 (1). pp. 151-156. ISSN 1788-1994 (print); 1788-3911 (online)
|
Text
606-article-p151.pdf - Published Version Available under License Creative Commons Attribution. Download (937kB) | Preview |
Abstract
Fair treatment of individuals in a scheduling task is essential. Unfairness can cause dissatisfaction among workers, faster obsolescence of work tools and underutilization of others. The literature's definitions vary, and there is no clear definition of general scheduling tasks. This article explores fair scheduling through the lens of final exams, aiming to extend decision support system methodologies. It proposes a method based on Lipschitz mapping to measure fairness and presents a pseudo-algorithm for estimating optimal trend lines. The model and the algorithm are demonstrated using the example of final exam schedules. In this way, two feasible solutions can be measured and compared in terms of fairness.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | fairness; scheduling; Lipschitz-mapping; workload; operations research; final exam scheduling |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Depositing User: | Emese Kató |
| Date Deposited: | 08 Aug 2024 09:26 |
| Last Modified: | 08 Aug 2024 09:26 |
| URI: | https://real.mtak.hu/id/eprint/202114 |
Actions (login required)
 |
Edit Item |
