Pembuatan Jadwal Shift Perawat Dengan Menggunakan Metode Constraint Satisfaction
Author(s) -
Rizal Rakhman Mustafa,
Yufis Azhar,
Nur Hayatin
Publication year - 2020
Publication title -
jurnal repositor
Language(s) - English
Resource type - Journals
eISSN - 2716-1382
pISSN - 2714-7975
DOI - 10.22219/repositor.v2i2.152
Subject(s) - mathematics
Hospitals is the institution health services that implemented health services in plenary individual that provides inpatient service, outpatient and emergency. Hospitals have some resources of a health facilities as, nurses, doctors and medical equipment should be made available for 24 hours a day of the week. For nurse in length working hours could have a bad impact on the health and the quality of work, therefore scheduling is a very important thing blind care in improve health care and the quality of work. Scheduling is expected to petrified the space to get schedule with a working hours more effective for each nurses and meet the existing scheduling. Constraint Programing (CP) is approach reckoning or computation mathematical to problems relating to the boundaries of variables, with the purpose of finding a solution that meet such a limit. This Constraint Satisfaction chosen because it has a flexible to implement the concept of , and having very accurate results and are considered to suitable for use in the resolution of problems as a schedule having a certain rule in its manufacture , and the number of variable and domain that is not too large , let alone the number has can be determined since the beginning. After performing evaluation to the research, can be concluded that the use of algorithm Constraint Satisfaction for the creation of schedule shift nurse was considered quite effective. Success in scheduling will reach 99.2% and 94%.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom