Managing Alternative Patient Appointments Using P-Graph Methodology.
Background: Patient appointment scheduling is one of the main challenging tasks in the healthcare administration and is constantly in the focus of theoretical researches. Objectives: The aim of this study was to investigate the applicability of the P-graph (Process graph) methodology to find the n-b...
| Publicado en: | Studies in Health Technology & Informatics Vol. 271; pp. 57 - 65 |
|---|---|
| Autores principales: | , , |
| Formato: | algorithm case study equations & formulas research tables/charts Journal Article |
| Publicado: |
Sage Publications Inc.
2020
|
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=144396544&site=ehost-live header: @attributes: shortDbName: ccm uiTerm: 144396544 longDbName: CINAHL Complete uiTag: AN controlInfo: bkinfo: dissinfo: jinfo: jid: 09269630 U1V jtl: Studies in Health Technology & Informatics issn: 09269630 maglogo: N pubinfo: dt: 2020 vid: 271 pid: 344 pub: Sage Publications Inc. place: Thousand Oaks, California artinfo: ui: 144396544 144396544 144396544 10.3233/SHTI200074 144396544 ppf: 57 ppct: 8 formats: tig: atl: Managing Alternative Patient Appointments Using P-Graph Methodology. aug: au: SÜLE, Zoltán BAUMGARTNER, János VATHY-FOGARASSY, Ágnes affil: Department of Computer Science and Systems Technology, University of Pannonia, Hungary sug: subj: Appointment and Scheduling Information Systems Algorithms Utilization Health Services Administration Human Decision Support Techniques Systems Analysis Mathematics Waiting Lists ab: Background: Patient appointment scheduling is one of the main challenging tasks in the healthcare administration and is constantly in the focus of theoretical researches. Objectives: 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. Methods: 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. Results: 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. pubtype: Academic Journal doctype: algorithm case study equations & formulas research tables/charts Journal Article ougenre: Article language: English refInfo: holdings: @attributes: islocal: N |
|---|