Although uncertainty is rife in many project management contexts, little is known about adaptively optimizing project schedules. We formulate the problem of adaptively optimizing the expected present value of a project's cash flow, and we show that it is practical to perform the optimization....

We define discrete time sequential games which are multiperson Markov decision processes. The extant theory is sketched and compared with our assessment of research needs in dynamic models of oligopoly and other competitive resource allocation problems. A special class of economic survival games...

Numerically valued reward processes are found in most dynamic programming models. Mitten, however, recently formulated finite horizon sequential decision processes in which a real-valued reward need not be earned at each stage. Instead of the cardinality assumption implicit in past models,...

A supply system's fill rate is the fraction of demand that is met from on-hand inventory. This paper presents formulas for the fill rate of periodic review supply systems that use base-stock-level policies. The first part of the paper contains fill-rate formulas for a single-stage system and...

Beckmann [1] and Mills [7] consider production smoothing problems in which demands are random variables. This paper generalizes and extends Beckmann's results which predicate backlogging of excess demand. Convex expected holding and penalty cost functions pertain to inventory and the cost of...

We model a firm's decisions about product innovation, focusing on the extent to which features should be improved or changed in the succession of models that comprise a life cycle. We show that the structure of the internal and external environment in which a firm operates suggests when to...