Mat Desa, Wan Laailatul Hanim and Abdul Rahman, Rosshairy and Law, Ying Hwei and Yong, Choy Fung (2018) Investigating the appointment scheduling system at dental clinic using greedy heuristics. Journal of Technology Management & Business, 5 (3). pp. 22-28. ISSN 2289-7224

PDF Restricted to Registered users only Download (369kB) | Request a copy

Abstract

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.

Item Type:	Article
Uncontrolled Keywords:	appointment, job shop scheduling, dental clinic, number of patients delayed, total time delayed
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:	School of Quantitative Sciences
Depositing User:	Mrs. Norazmilah Yaakub
Date Deposited:	09 May 2019 06:10
Last Modified:	09 May 2019 06:10
URI:	https://repo.uum.edu.my/id/eprint/26032

Actions (login required)

View Item