Gunawan, Chandra Ari and Toba, Hapnes (2015) Pembangkitan Solusi Penjadwalan Berprioritas Melalui Penerapan Constraint Satisfaction Problem (Studi Kasus: Laboratorium Fakultas Teknologi Informasi Universitas XXX). Jurnal Teknik Informatika dan Sistem Informasi, 2 (1). pp. 43-52. ISSN 2443-2229
|
Text
8.pdf - Published Version Download (1065Kb) | Preview |
Abstract
Generating schedule for personnel is one of the classic problems in organizations. Although there are many techniques have been introduced, there is no ultimate solution has been known. In this sense, there are always some aspects which are unique and specific applied in an organization. In this paper we propose an approach to generate personnel schedules in a flexible manner. The flexibility is offers in a way that the administrator can set which criteria should be prioritized, and the personnels are allow to enter their available schedules. The priority level is fulfilled by applying the ‘most constraining value’-strategy of the Constraint Satisfaction Problem (CSP) approach. The approach is evaluated in a staff scheduling system at the Computer Laboratory of the Faculty of Information Technology (FIT) at XXX University. The results show that the approach has comparable schedule candidates, comparing to the ones created manually by human.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Constraint Satisfaction Problem, Rekayasa Pembangkitan Jadwal, Mekanisme Penjadwalan Staf, Sistem Pengelolaan Laboratorium, Pola Desain Perangkat Lunak |
| Subjects: | T Technology > T Technology (General) |
| Depositing User: | Perpustakaan Maranatha |
| Date Deposited: | 20 Dec 2017 08:07 |
| Last Modified: | 10 Oct 2018 08:56 |
| URI: | http://repository.maranatha.edu/id/eprint/23797 |
Actions (login required)
 |
View Item |
