000			01679nam a22002297a 4500
001			9430
003			OCLRC
005			20260730103743.0
008			210503t xxu||||| |||| 00| 0 eng d
040			_aOCLRC
100			_aYan, Chongjun
245			_aComparison of Traditional and Open-Access Appointment Scheduling for Exponentially Distributed Service Time. _cChongjun Yan
260			_c2015.
500			_ahttps://doi.org/10.1260/2040-2295.6.3.345
520			_aThis paper compares the performance measures of traditional appointment scheduling (AS) with those of an open-access appointment scheduling (OA-AS) system with exponentially distributed service time. A queueing model is formulated for the traditional AS system with no-show probability. The OA-AS models assume that all patients who call before the session begins will show up for the appointment on time. Two types of OA-AS systems are considered: with a same-session policy and with a same-or-next-session policy. Numerical results indicate that the superiority of OA-AS systems is not as obvious as those under deterministic scenarios. The same-session system has a threshold of relative waiting cost, after which the traditional system always has higher total costs, and the same-or-next-session system is always preferable, except when the no-show probability or the weight of patients� waiting is low. It is concluded that open-access policies can be viewed as alternative approaches to mitigate the negative effects of no-show patients.
653			_aappointment scheduling,
653			_aopen access,
700			_aTang, Jiafu
700			_aBowen, Fung
700			_aRichard Y.K.
942			_cELEC
999			_c9430 _d9430