We study the problems of scheduling jobs, with different release dates and equal processing times, on two types of batching machines. All jobs of the same batch start and are completed simultaneously. On a serial batching machine, the length of a batch equals the sum of the processing times of...

Multi-class service systems are of increasing importance in the practical modelling world but present a significant challenge for analysis. Most results to date concerning the optimal dynamic control of such systems have assumed holding cost rates to be linear in the number of customers present....

The coupled task problem is to schedule n jobs on one machine where each job consists of two subtasks with required delay time between them. The objective is to minimize the makespan. This problem was analyzed in depth by Orman and Potts [3]. They investigated the complexity of different cases...

We study the problem of optimally controlling a multiserver queueing system. Customers arrive in a Poisson fashion and join a single queue, served by N servers, S <Subscript>1</Subscript>,S <Subscript>2</Subscript>,… , S <Subscript>N</Subscript>. The servers have different rates. The service times at each server are independent and exponentially distributed....</subscript></subscript></subscript>

In this paper we consider Markov Decision Processes with discounted cost and a random rate in Borel spaces. We establish the dynamic programming algorithm in finite and infinity horizon cases. We provide conditions for the existence of measurable selectors. And we show an example of...

The control problem of controlling ruin probabilities by investments in a financial market is studied. The insurance business is described by the usual Cramer-Lundberg-type model and the risk driver of the financial market is a compound Poisson process. Conditions for investments to be...

We study the situation where there are a number of on-going production processes each yielding a state-dependent standard reward in discrete time. At each time step one may select at most one of these processes for improvement; the selected process will yield a state-dependent non-standard...

The paper studies connections between arbitrage and utility maximization in a discrete-time financial market. The market is incomplete. Thus one has several choices of equivalent martingale measures to price contingent claims. Davis determines a unique price for a contingent claim which is based...

We show the existence ofaverage cost (AC-) optimal policy for an inventory system withuncountable state space; in fact, the AC-optimal cost and an AC-optimal stationary policy areexplicitly computed. In order to do this, we use a variant of thevanishing discount factor approach, which have been...

The purpose of this paper is to investigate the structural properties of the optimal batch acceptance policy in a Markovian queueing system where different classes of customers arrive in batches and the buffer capacity is finite. We prove that the optimal policy can possess certain monotonicity...