Abstract
Patient appointment scheduling is one of the main challenging tasks in the healthcare administration and is constantly in the focus of theoretical researches. The aim of this study was to investigate the applicability of the P-graph (Process graph) methodology to find the n-best alternative for patient's scheduling. The patient appointment scheduling task was formalised as an integer linear programming problem and was considered as a process network synthesis problem. The optimal and n-best alternative solutions were determined by an efficient branch and bound algorithm implemented in a decision support system. Experimental results show, that the P-graph methodology can be effectively applied to produce the optimal scheduling for the examinations and to find the alternatives of the best scheduling.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
