Ayrıntılı Bilimsel Program ve Bildiri Özetleri - YAEM2010

Ç3-01
YAEM 2010
YÖNEYLEM ARAÞTIRMASI VE ENDÜSTRÝ MÜHENDÝSLÝGI 30. ULUSAL KONGRESÝ
Saðlýk Sistemleri 1: Health Systems (I)
30 Haziran 2010 / 15:30 - 17:00
Oturum Salonu: MDBF G029
Oturum Düzenleyicisi: Vedat Verter ve Tuðba Çayýrlý
Oturum Baþkaný: Vedat Verter
Exact and Sampling-based Methods for Appointment
Scheduling with Discrete Random Durations
1 2 3
Mehmet Atilla Begen , Retsef Levi , Maurice Queyranne
1 Richard Ivey School of Business, University of Western Ontario,
London ON, Canada
2 Sloan School of Management, MIT, Cambridge MA, USA
3 Sauder School of Business, University of British Columbia, Vancouver
BC, Canada
We determine optimal appointment schedule for a given sequence of
jobs (e.g., surgeries, physician appointments) on a single processor
(e.g., operating room, physician), to minimize the expected total
underage (idle-time of the processor) and overage costs (waiting time
of jobs and overtime of the processor) when each job has an integer
random processing duration given by a joint discrete probability
distribution. Simple conditions on the cost rates imply that the
objective function is sub modular and L-convex. Then there exists an
optimal appointment schedule which is integer and can be found in
polynomial time. In the case of unknown duration distributions, we
determine bounds on the number of independent samples required to
obtain provably near-optimal solution with high probability. Besides
surgeries, there are many applications of the appointment scheduling
problem such as project scheduling, container vessel and terminal
operations, gate and runway scheduling of aircrafts in an airport. We
believe that our framework is sufficiently generic so that it is portable
and applicable to many appointment systems in healthcare as well as
in other areas.
60