Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/54328
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNapat Harnpornchaien_US
dc.contributor.authorKittawit Autchariyapanitkulen_US
dc.contributor.authorJirakom Sirisrisakulchaien_US
dc.contributor.authorSongsak Sriboonchittaen_US
dc.date.accessioned2018-09-04T10:12:03Z-
dc.date.available2018-09-04T10:12:03Z-
dc.date.issued2015-09-01en_US
dc.identifier.issn18838014en_US
dc.identifier.issn13430130en_US
dc.identifier.other2-s2.0-84943376386en_US
dc.identifier.other10.20965/jaciii.2015.p0585en_US
dc.identifier.urihttps://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84943376386&origin=inwarden_US
dc.identifier.urihttp://cmuir.cmu.ac.th/jspui/handle/6653943832/54328-
dc.description.abstractThe optimal number of doctors and appointment interval for an outpatient appointment system in a class of individual block/fixed interval are determined using an adaptive-penalty Genetic Algorithm. The length of service time for doctor consultation, the time required for the laboratory tests, and the time deviating from the appointment time are modelled by random variables. No-show patients are also included in the system. Using the adaptive penalty scheme, optimization constraints are automatically and numerically handled. The solution methodology is readily applicable to other appointment systems. The study has a significant implication from the viewpoint of economic and risk management of health care service.en_US
dc.subjectComputer Scienceen_US
dc.titleOptimal outpatient appointment system with uncertain parameters using adaptive-penalty genetic algorithmen_US
dc.typeJournalen_US
article.title.sourcetitleJournal of Advanced Computational Intelligence and Intelligent Informaticsen_US
article.volume19en_US
article.stream.affiliationsChiang Mai Universityen_US
article.stream.affiliationsMaejo Universityen_US
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


Items in CMUIR are protected by copyright, with all rights reserved, unless otherwise indicated.