Daiki Min

Prof. Daiki Min

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2010 in European Journal of Operational Research
Verified
Journal Article
Closed access
DMDaiki Min
Daiki Min
YYYuehwern Yih
Yuehwern Yih

1 June 2010 in Computers & Operations Research
Verified
Journal Article
Closed access
DMDaiki Min
Daiki Min
YYYuehwern Yih
Yuehwern Yih


18 October 2013 in SIMULATION
Verified
Journal Article
Open access
SLSangbok Lee
Sangbok Lee
DMDaiki Min
Daiki Min
JRJong-hyun Ryu
Jong-hyun Ryu
YYYuehwern Yih
Yuehwern Yih
Patient appointment scheduling (AS) in outpatient clinics is a widely studied subject and plays an important role in facilitating the efficient use of clinical resources and patients’ timely access to quality care. This paper considers two AS systems: open access (OA) and overbooking (OB). Clinics make strategic decisions on selecting an AS system and then make tactical decisions on the efficient or optimal use of the system based on the selection. This study proposes some guidelines for the strategic choice of an AS system. For this purpose, we conduct a discrete-event simulation to compare the two AS systems under various environments. We employ four performance measures for the comparison: overtime work, the proportion of unmet demand, in-clinic waiting times, and the use of appointment time slots. For the analysis, we devise an integrated measure representing a linear combination of the four measures. We divide the analysis into two phases. In the first phase, well-performed OA and OB policies are separately identified, and in the second phase, the two scheduling systems with the identified policies are compared. We find overbooking is more robust to various clinic environments and performs better than open access in general. Along with that result, we additionally suggest some rules for determining best open access and overbooking policies.

1 August 2018 in Computers & Operations Research
Verified
Journal Article
Closed access
DMDaiki Min
Daiki Min
JRJong-hyun Ryu
Jong-hyun Ryu
DCDong Gu Choi
Dong Gu Choi

5 December 2013 in RAIRO - Operations Research
Verified
Journal Article
Closed access
PDF file
DMDaiki Min
Daiki Min
YYYuehwern Yih
Yuehwern Yih
This paper addresses the problem of managing a waiting list for elective surgery to decide the number of patients selected from the waiting list and to schedule them in accordance with the operating room capacity in the next period. The waiting list prioritizes patients not only by their initial urgency level but also by their waiting time. Selecting elective surgery patients requires a balance between the waiting time for urgent patients and that for less urgent patients. The problem is formulated as an infinite horizon Markov Decision Process. Further, the study proposes a scheduling procedure based on structural properties of an optimal policy by taking a sampling-based finite horizon approximation approach. Finally, we examine the performance of the policy under various conditions.