<? show [AQ ID= GQ2 POS=-24pt]?><? show [AQ ID= GQ5 POS= 12pt]?> Consider a single
server that should serve a given number of customers during a fixed period. The …

This paper investigates a sequencing and scheduling problem incorporating waiting time
tolerance. The objective is to determine an arrival time for each appointment to minimize the …

In this paper, we analyze appointment systems involving heterogeneous customers, each
requesting different services, with nonstationary arrival processes. The main goal is to …

We consider a surgical case scheduling problem with the objective of minimizing the
expected time span of the schedule subject to a prespecified upper bound on the expected …

Course assignment is a very widespread problem in education and beyond. Typically,
students have preferences for bundles of course seats or course schedules over the week …

Inventory models with lost sales and large lead times are notoriously difficult to manage due
to the curse of dimensionality. Recently, Goldberg et al.(2016) and Xin and Goldberg (2016) …

We consider a generic Markov decision process (MDP) with two controls: one control taking
effect immediately and the other control whose effect is delayed by a positive lead time. As …

We study an appointment-based slotted-service queue with the goal of maximizing service
volume. Returning customers prefer to be served by the same service agent as in their …

Electronic visits, or “E-visits” for short, have emerged as a promising channel for accessing
healthcare and can significantly impact daily operations in healthcare facilities. However …

This dissertation explores distribution-free methods for stochastic models. Traditional
approaches operate on the premise of complete knowledge about the probability …