One formulation of the machine sequencing problem is that of finding a minimaximal path in a disjunctive graph. This paper describes an implicit enumeration procedure that solves the problem by ...

This is a study of finite state discrete time discounted Markovian decision process when the states are probabilistically observed. A model of this process is formulated, and an implicit enumeration ...