17th International Symposium on
Mathematical Theory of Networks and Systems
Kyoto International Conference Hall, Kyoto, Japan, July 24-28, 2006

MTNS 2006 Paper Abstract


Paper TuP12.6

Ramírez-Hernández, Jose A. (Univ. of Cincinnati), Fernandez, Emmanuel (Univ. of Cincinnati)

Optimal Job Sequencing Control in a Benchmark Reentrant Line with Finite Capacity Buffers

Scheduled for presentation during the Regular Session "Optimization" (TuP12), Tuesday, July 25, 2006, 17:25−17:50, Room 104b

17th International Symposium on Mathematical Theory of Networks and Systems, July 24-28, 2006, Kyoto, Japan

This information is tentative and subject to change. Compiled on May 19, 2024

Keywords Optimal control, Dynamic programming, Control of stochastic systems


This paper presents the optimality condition, Bellman’s equation, and an optimal job sequencing policy for a benchmark reentrant line (RL) with finite capacity buffers. The optimal policy is obtained for an infinite horizon discounted cost criterion, and is characterized by an index which is a function of the one-stage cost function and system’s parameters. In addition, when the buffer levels are below its maximum capacity, necessary and sufficient conditions for optimality are obtained, and the optimal policy is independent of the discount factor. Therefore, the policy exhibits characteristics similar to Blackwell optimal policies. Numerical examples are presented on which the optimal policy is obtained for both quadratic and linear one-stage cost functions.