We study appointment scheduling problems in continuous time. A finite number of clients are scheduled such that a function of the waiting time of clients, the idle time of the server, and the lateness of the schedule is minimized. The optimal schedule is notoriously hard to derive within...

In this paper we consider a single-item inventory system with lost sales and fixed order cost. We numerically illustrate the lack of a clear structure in optimal replenishment policies for such systems. However, policies with a simple structure are preferred in practical settings. Examples of...

Resource allocation is a relatively new research area in survey designs and has not been fully addressed in the literature. Recently, the declining participation rates and increasing survey costs have steered research interests towards resource planning. Survey organizations across the world are...

Field services are a particular type of after-sales service performed at the customer's location where technicians repair malfunctioning machines. The inventory decisions about which spare part types to take to the repair site and in what quantities is called the repair kit problem. This problem...

We consider a call center with two classes of impatient customers: premium and regular classes. Modeling our call center as a multiclass GI/GI/s+M queue, we focus on developing scheduling policies that satisfy a target ratio constraint on the abandonment probabilities of premium customers to...