抄録
In this paper, we present a new model for optimal control of discrete event systems (DESs)with arbitrary control pattern and rewards for choosing control inputs at strings. The performance measure is to maximize the discounted total reward among strings. We divide the problem into three sub-cases where the optimal value is respectively finite, positive infinite and negative infinite. For the case with finite optimal values, the optimality equation is shown and further is characterized with its solutions. Moreover, we show that when the reward function is stationary, the optimality equation and its solution are also stationary. Finally, we apply the above model and results to a job matching problem.
