Suppose there are n men available to perform n jobs. The n jobs occur in sequential order with the value of each job being a random variable X. Associated with each man is a probability p. If a "p"… Expand

Several problems in the optimal control of dynamic systems are considered. When observed, a system is classifiable into one of a finite number of states and controlled by making one of a finite… Expand

A system e.g., a motor vehicle must operate for t units of time. A certain component e.g., a battery is essential for its operation and must be replaced each time it fails. There are n types of… Expand

Certain sets of numbers {ain}, i = 0,..., n, n = 1, 2,..., are known characterize an optimal sequential assignment policy. In this paper the limiting behavior as n → ∞ of the ain's is studied.

A class of inventory and distribution policies for scheduled deliveries of perishable products subject to variable demand is modeled as a Markov chain with a manageable number of states. From its… Expand