Relative value function approximation for the capacitated Re-entrant line scheduling problem

IEEE Transactions on Automation Science and Engineering

Volumn 2, Issue 3, 2005, Pages 285-299

  Choi, Jin Young ^a   Reveliotis, Spyros ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Capacitated re entrant line (CRL); Neuro dynamic programming; Relative value function approximation; Scheduling

Indexed keywords

APPROXIMATION THEORY; AUTOMATION; COMPUTER SYSTEM RECOVERY; DYNAMIC PROGRAMMING; FORMAL LOGIC; PUBLIC POLICY;

AUTOMATED PRODUCTION SYSTEMS; CAPACITATED RE-ENTRANT LINE (CRL); NEURO-DYNAMIC PROGRAMMING; RELATIVE VALUE FUNCTION APPROXIMATION;

SCHEDULING;

EID: 23844441654     PISSN: 15455955     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASE.2005.849085     Document Type: Article

References (25)

1. P. R. Kumar, "Scheduling manufacturing systems of re-entrant lines," in Stochastic Modeling and Analysis of Manufacturing Systems, D. D. Yao, Ed. Berlin, Germany: Springer-Verlag, 1994, pp. 325-360.
2. J. Y. Choi and S. A. Reveliotis, "A generalized stochastic petri net model for performance analysis and control of capacitated re-entrant lines," IEEE Trans. Robot. Automat., vol. 19, no. 3, pp. 474-80, Jun. 2003.
3. S. A. Reveliotis, M. A. Lawley, and P. M. Ferreira, "Structural control of large-scale flexibly automated manufacturing systems," in The Design of Manufacturing Systems, C. T. Leondes, Ed. Boca Raton, FL: CRC, 2001, pp. 4-1-4-34.
4. D. D. Yao, Ed., Stochastic Modeling and Analysis of Manufacturing Systems. New York: Springer-Verlag, 1994.
5. L. M. Wein, "Scheduling semiconductor wafer fabrication," IEEE Trans. Semicond. Manufact., vol. 1, no. 3, pp. 115-130, Aug. 1988.
6. P. R. Kumar, "Scheduling semiconductor manufacturing plants," IEEE Control Syst. Mag., vol. 14, no. 6, pp. 33-40, 1994.
7. S. H. Lu, D. Ramaswamy, and P. R. Kumar, "Efficient scheduling policies to reduce mean and variance of cycle-time in semiconductor manufacturing plants," IEEE Trans. Semicond. Manuf., vol. 7, no. 3, pp. 374-385, Aug. 1994.
8. S. Kumar and P. R. Kumar, "Fluctuation smoothing policies are stable for stochastic re-entrant lines," Discrete-Event Dynam. Syst.: Theory and Applicat., vol. 6, pp. 361-370, 1996.
9. _, "Queueing network models in the design and analysis of semiconductor wafer fabs," IEEE Trans. Robot. Automat., vol. 17, pp. 548-561, 2001.
10. S. A. Reveliotis, "The destabilizing effect of blocking due to finite buffering capacity in multi-class queueing networks," IEEE Trans. Autom. Control, vol. 45, no. 3, pp. 585-588, Mar. 2000.
11. M. A. Lawley and S. A. Reveliotis, "Deadlock avoidance for sequential resource allocation systems: Hard and easy cases," Int. J. FMS, vol. 13, no. 4, pp. 385-404, 2001.
12. C. A. Papadimitriou and J. N. Tsitsiklis, "The complexity of optimal queueing network control," Math. Oper. Res., vol. 24, no. 2, pp. 293-305, 1999.
13. D. P. Bertsekas and J. N. Tsitsiklis, Neuro-Dynamic Programming. Belmont, MA: Athena Scientific, 1996.
14. J. N. Tsitsiklis and B. Van Roy, "Feature-based methods for large scale dynamic programming," Machine Learning, vol. 22, pp. 59-94, 1996.
15. B. Van Roy, "Learning and value function approximation in complex decision processes," Ph.D. dissertation, Dept. Elect. Eng. Comp. Sci., Massachusetts Inst. Technol., Cambridge, 1998.
16. D. P. de Farias, "The linear programming approach to approximate dynamic programming: Theory and application," Ph.D. dissertation, Dept. Manag. Sci. Eng., Massachusetts Inst. Technol., Cambridge, Jun. 2002.
17. M. L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming. New York: Wiley, 1994.
18. C. G. Cassandras and S. Lafortune, Introduction to Discrete Event Systems. Boston, MA: Kluwer, 1999.
19. P. Glasserman and D. D. Yao, Monotone Structure in Discrete Event Systems: Wiley, 1994.
20. D. P. Bertsekas, Dynamic Programming and Optimal Control. Belmont, MA: Athena Scientific, 1995, vol. 2.
21. D. Bertsimas, I. C. Paschalidis, and J. N. Tsitsiklis, "Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance," Ann. Appl. Probabil, vol.4, no. 1, pp. 43-75, 1994.
22. J. N. Kumar and P. R. Kumar, "Performance bounds for queueing networks and scheduling policies," IEEE Trans. Autom. Control, vol. 39, no. 8, pp. 1600-1611, Aug. 1994.
23. P. J. Schweitzer and A. Seidmann, "Generalized polynomial approximations in Markov decision processes," J. Math. Anal. Applicat., vol. 110, pp. 568-582, 1985.
24. A. J. Hayter, Probability and Statistics. Boston, MA: International Thomson, 1996.
25. J. Y. Choi, "Performance modeling, analysis, and control of capacitated re-entrant lines," Ph.D. dissertation, School of Ind. Syst. Eng., Georgia Inst. Technol., Atlanta, 2004.