In this paper we study the problem of personnel planning in care-at-home facilities. We model the system as a Markov decision process, which leads to a high-dimensional control problem. We study monotonicity properties of the system and derive structural results for the optimal policy. Based on...

We consider the problem of a firm (“the buyer”) that must acquire a fixed number (L) of items. The buyer can acquire these items either at a fixed buy-it-now price in the open market or by participating in a sequence of NL auctions. The objective of the buyer is to minimize his expected...

Motivated by the dispatching of trucks to shovels in surface mines, we study optimal routing in a Markovian finite-source, multi-server queueing system with heterogeneous servers, each with a separate queue. We formulate the problem of routing customers to servers to maximize the system...

We develop a finite-horizon discrete-time constrained Markov decision process (MDP) to model diagnostic decisions after mammography where we maximize the total expected quality-adjusted life years (QALYs) of a patient under resource constraints. We use clinical data to estimate the parameters of...

We determine the value of monitoring perishable freight in-transit for a single vehicle traveling from an origin to a destination. We develop a computationally practical approach for determining the optimal expected cost function and an optimal policy, based on an infinite horizon partially...

Abstract Assume that the surplus process of an insurance company is described by a general Lévy process and that possible dividend pay-outs to shareholders are restricted to random discrete times which are determined by an independent renewal process. Under this setting we show that the optimal...

End-stage renal disease (ESRD) is the ninth-leading cause of death in the U.S. Transplantation is the most viable renal replacement therapy for ESRD patients, but there is a severe disparity between the demand for kidneys for transplantation and the supply. This shortage is further complicated...