appointment scheduling with discrete random durations
We consider the problem of determining optimal appointment schedule for a given sequence of jobs (e.g., medical procedures) on a single processor (e.g., operating room, examination facility), to minimize the expected total underage and overage costs when each job has a random processing duration given by a joint discrete probability distribution. Simple conditions on the cost rates imply that the objective functionis submodular and Lconvex. Then there exists an optimal appointment schedule which is integer and can be found in polynomial time. Our model can handle a given due date for the total processing (e.g., end of day for an operating room) after which overtime is incurred, as well as noshows and emergencies. This is joint work with Mehmet Begen (Sauder School of Business,University of British Columbia).

 Contacto
 Departamento de Ingeniería Industrial   Facultad de Ciencias Físicas y Matemáticas  Universidad de Chile  República 701, Santiago, Chile  Teléfono:(562)9784072  Fax:(562)9784011 