Investigating the appointment scheduling system at dental clinic using greedy heuristics

• Main Authors: Mat Desa, Wan Laailatul Hanim, Abdul Rahman, Rosshairy, Law, Ying Hwei, Yong, Choy Fung
• Format: Article
• Language: English
• Published: Universiti Tun Hussein Onn Malaysia 2018
• Subjects: QA75 Electronic computers. Computer science
• Online Access: http://repo.uum.edu.my/26032/1/JTMB%205%203%202018%2022%2028.pdf; http://repo.uum.edu.my/26032/; http://doi.org/10.30880/jtmb.2018.05.03.004
• Institution: Universiti Utara Malaysia

This study was designed to discuss the application of job shop scheduling with greedy technique to investigate the total time delayed for completing the dental treatment in the dental clinic. The aim of this study is to identify the total number of patients delayed for completing the dental treatment as scheduled per day. Besides, this study also aims to examine the solution obtained from each greedy technique. There are three greedy techniques have been employed which are the earliest due date, shortest processing time and longest processing time. The result of the investigation indicated that the techniques of the earliest due date and shortest processing time provide optimal solution with no delays. It is shows that the solution from this study can be used as a guideline of patient scheduling in any related application.