Relative value function approximation for the capacitated re-entrant line scheduling problem: an experimental investigation

The problem addressed in this work is that of determining how to allocate the workstation processing and buffering capacity in a capacitated re-entrant line to the job instances competing for it, in order to maximize its longrun/steady-state throughput, while maintaining the logical correctness of the underlying material flow, i.e., deadlock-free operations. An approximation scheme for the optimal policy that is based on neuro-dynamic programming theory is proposed, and its performance is assessed through a numerical experiment. The derived results indicate that the proposed method holds considerable promise for providing a viable, computationally efficient approach to the problem, and highlight directions for further investigation.

[1]  Benjamin Van Roy,et al.  Feature-based methods for large scale dynamic programming , 1995 .

[2]  John N. Tsitsiklis,et al.  Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.

[3]  John N. Tsitsiklis,et al.  Feature-based methods for large scale dynamic programming , 2004, Machine Learning.

[4]  S. Fotopoulos.  Stochastic modeling and analysis of manufacturing systems , 1996 .

[5]  Sunil Kumar,et al.  Fluctuation smoothing policies are stable for stochastic re-entrant lines , 1996, Discret. Event Dyn. Syst..

[6]  Benjamin Van Roy,et al.  The linear programming approach to approximate dynamic programming: theory and application , 2002 .

[7]  Spyros Reveliotis,et al.  Structural Control of Large-Scale Flexibly Automated Manufacturing Systems , 2019, The Design of Manufacturing Systems.

[8]  Spyros A. Reveliotis,et al.  A generalized stochastic Petri net model for performance analysis and control of capacitated reentrant lines , 2003, IEEE Trans. Robotics Autom..

[9]  P. Schweitzer,et al.  Generalized polynomial approximations in Markovian decision processes , 1985 .

[10]  John N. Tsitsiklis,et al.  Optimization of multiclass queuing networks: polyhedral and nonlinear characterizations of achievable performance , 1994 .

[11]  Lawrence M. Wein,et al.  Scheduling semiconductor wafer fabrication , 1988 .

[12]  Jin Young Choi,et al.  Performance Modeling, Analysis and Control of Capacitated Re-entrant Lines , 2004 .

[13]  P. R. Kumar,et al.  Performance bounds for queueing networks and scheduling policies , 1994, IEEE Trans. Autom. Control..

[14]  Sunil Kumar,et al.  Queueing network models in the design and analysis of semiconductor wafer fabs , 2001, IEEE Trans. Robotics Autom..

[15]  Benjamin Van Roy.  Learning and value function approximation in complex decision processes , 1998 .

[16]  P. R. Kumar.  Scheduling Manufacturing Systems of Re-Entrant Lines , 1994 .

[17]  P.R. Kumar.  Scheduling semiconductor manufacturing plants , 1994, IEEE Control Systems.

[18]  S.C.H. Lu,et al.  Efficient scheduling policies to reduce mean and variance of cycle-time in semiconductor manufacturing plants , 1994 .

[19]  Spyros A. Reveliotis,et al.  The destabilizing effect of blocking due to finite buffering capacity in multi-class queueing networks , 2000, IEEE Trans. Autom. Control..

[20]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .