E-Appointment Scheduling (EAS)

Authors: Noraziah Ahmad, Roslina Mohd Sidek, Mohd Affendy Omardin

Abstract:

E-Appointment Scheduling (EAS) has been developed to handle appointment for UMP students, lecturers in Faculty of Computer Systems & Software Engineering (FCSSE) and Student Medical Center. The schedules are based on the timetable and university activities. Constraints Logic Programming (CLP) has been implemented to solve the scheduling problems by giving recommendation to the users in part of determining any available slots from the lecturers and doctors- timetable. By using this system, we can avoid wasting time and cost because this application will set an appointment by auto-generated. In addition, this system can be an alternative to the lecturers and doctors to make decisions whether to approve or reject the appointments.

Keywords: EAS, Constraint Logic Programming, PHP, Apache.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1328192

References:

[1] B. Lee, "Story Boarding for Web-Based Information System 1", Reed Elsevier Business Publishing Ltd-National Health Service Online Appointment System, Karl Cushing, 2001.
[2] C.Dudman, "Government Activity, Copyright 2001", Reed Elsevier Business Publishing Ltd., 2001.
[3] Leirer, Morrow, Parinute & Doksum, "Appointment system", 1980.
[4] N.M. Nik Ismail, E-Meeting with C#, PSM from BCN for Guideline, University Malaysia Pahang, 2004.
[5] P.F.Dutot, G Mouni-e, D.Trystram, "Operating Systems Internals and Design Principles", 5th International Edition, Prentice Hall, 2004, pp. 189-203.
[6] T.M. Connolly, and C.E. Begg, "Database Systems: A practical Approach to Design, Implementation, and Management", 5th Ed. Addison-Wesley, 2010, pp. 199-205
[7] N. Kaushik and S. Figueira, Scheduling in e-Business. Dollar Universe United State of America, 2005.
[8] F. Benhamou and A. Colmerauer, What is Constraint (Logic) Programming, Sept 1993.
[9] J.A Hoffer, J.F. George, J.S Valancich, "Modern System Analysis & Design", 3rd Edition. United State of America: Prentice Hall, 2002, pp. 88-91.