appointment problem
Recently Published Documents


TOTAL DOCUMENTS

2
(FIVE YEARS 0)

H-INDEX

1
(FIVE YEARS 0)

2015 ◽  
Vol 45 (3) ◽  
pp. 699-708 ◽  
Author(s):  
Youngsub Chun ◽  
Nari Park ◽  
Duygu Yengin


2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Li Luo ◽  
Chun-rong Qin ◽  
Shi-jun Tang ◽  
Xian Chen ◽  
Hui-li Guo

From the on-line point, we consider the hospital’s medical examination appointment problem with hierarchical machines. This approach eliminates the need for both demand forecasts and a risk-neutrality assumption. Due to different unit revenue, uncertain demand, and arrival of patients, we design on-line booking policies for two kinds of different situations from the perspective of on-line policy and competitive analysis. After that, we prove the optimal competitive ratios. Through numerical examples, we compare advantages and disadvantages between on-line policies and traditional policies, finding that there is different superiority for these two policies under different arrival sequences.



Sign in / Sign up

Export Citation Format

Share Document