Abstract
In this paper, we investigate a time optimal job shop type scheduling problem including jobs with uncertain processing times. Modeling the problem by the stochastic time Petri net (STPN) in which some transitions have statistically varying firing times, we derived the stochastically suboptimal (non-delayed) schedule. The approach is illustrated by two examples and the results are compared with those of Monte Carlo simulations.
