A simulation-based Approximate Dynamic Programming approach for the control of the intel Mini-Fab benchmark model

Proceedings - Winter Simulation Conference

Volumn , Issue , 2009, Pages 1634-1645

  Ramírez Hernández, José A ^a   Fernandez, Emmanuel ^a  

^a University of Cincinnati   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTOR CRITIC; APPROXIMATE DYNAMIC PROGRAMMING; AVERAGE COST; BENCHMARK MODELS; CYCLE TIME; DISPATCHING RULES; SEMICONDUCTOR FABS; SIMULATION EXPERIMENTS; SIMULATION-BASED; WORK-IN-PROCESS;

CHANNEL CAPACITY; DYNAMIC PROGRAMMING; LEARNING ALGORITHMS;

BENCHMARKING;

EID: 77951597947     PISSN: 08917736     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WSC.2009.5429179     Document Type: Conference Paper

References (25)

1. Bertsekas, D. P. 2000. Dynamic programming and optimal control. Second ed, Volume II. Bellmont, MA: Athena Scientific.
2. Bertsekas, D. P., and J. N. Tsitsiklis. 1996. Neuro-dynamic programming. Bellmont, MA: Athena Scientific.
3. Kempf, K. 1994. Intel five-machine six step mini-fab description. Available via 〈http://www.eas.asu.edu/~research/intel/papers/fabspec. html〉 [accessed March 29, 2009].
4. Kumar, P. R. 1993. Re-entrant lines. Queueing Systems: Theory and Applications 13:87-110.
5. Kumar, P. R. 1994. Scheduling semiconductor manufacturing plants. IEEE Control Systems Magazine 39 (11): 33-40.
6. Kumar, S., and P. R. Kumar. 2001. Queueing network models in the design and analysis of semiconductor wafer fabs. IEEE Transactions on Robotics and Automation 17 (5): 548-561. (Pubitemid 33137772)
7. Little, J. D. C. 1961. A proof for the queueing formula: L=λw. Operations Research 9 (3): 383-387.
8. Meyn, S. 2008. Control techniques for complex networks. New York, NY: Cambridge University Press.
9. Meyn, S. P. 1997. The policy iteration algorithm for average reward markov decision processes with general state space. IEEE Transactions on Automatic Control 42 (12): 1663-1680.
10. Powell, W. B. 2007. Approximate dynamic programming: Solving the curses of dimensionality. Hoboken, NJ: Wiley-Interscience.
11. Puterman, M. L. 1994. Markov decision processes: Discrete stochastic dynamic programming. New York, NY: John Wiley & Sons, Inc.
12. Ramírez-Hernández, J. A., and E. Fernandez. 2005, December 12-15. A case study in scheduling reentrant manufacturing lines: Optimal and simulation-based approaches. In Proceedings of the 44th IEEE Conference on Decision and Control, and the European Control Conference 2005, 2158-2163. Seville, Spain.
13. Ramírez-Hernández, J. A., and E. Fernandez. 2007a, April. An approximate dynamic programming approach for job releasing and sequencing in a reentrant manufacturing line. In Proceedings of the 2007 IEEE Symposium on Approximate Dynamic Programming and Reinforcement Learning (ADPRL 2007), 201-208. Honolulu, HI.
14. Ramírez-Hernández, J. A., and E. Fernandez. 2007b, December 13-15. Control of a re-entrant line manufacturing model with a reinforcement learning approach. In Proceedings of the Sixth International Conference on Machine Learning and Applications (ICMLA'07), 330-335. Cincinnati, OH.
15. Ramírez-Hernández, J. A., and E. Fernandez. 2009. Simulation-based approximate dynamic programming for near-optimal control of re-entrant line manufacturing models. submitted to IEEE Transactions on Automation Science & Engineering.
16. Ramírez-Hernández, J. A., H. Li, E. Fernandez, C. R. McLean, and S. Leong. 2005, December. A framework for standard modular simulation in semiconductor wafer fabrication systems. In Proceedings of the 2005 Winter Simulation Conference, ed. M. E. Kuhl, N. M. Steiger, F. B. Armstrong, and J. A. Joines, 2162-2171. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers, Inc.
17. Shen, Y., and R. Leachman. 2003. Stochastic wafer fabrication scheduling. IEEE Trans. on Semic. Manufac. 16 (1): 2-14.
18. Si, J., A. G. Barto, W. B. Powell, and D. W. II. (Eds.) 2004. Handbook of learning and approximate dynamic programming. IEEE Press, Wiley-Interscience.
19. Sutton, R. S., and A. G. Barto. 1998. Reinforcement learning: An introduction. Cambridge, MA: MIT Press.
20. Applied Materials 2009. AutoMod. Available via 〈http://www.automod. com〉 [accessed March 31, 2009].
21. Modeling and Analysis For Semiconductor Manufacturing Laboratory (MASMLab), Arizona State University 2003. Test bed. Available via 〈http://www.eas.asu.edu/masmlab/〉 [accessed March 29, 2009].
22. Tsakalis, K. S., J. J. F. Godoy, and A. A. Rodriguez. 1997. Hierarchical modeling and control for re-entrant semiconductor fabrication lines: A mini-fab bechmark. In Proceedings of the 6th IEEE International Conference ETFA, 514-519.
23. Tsitsiklis, J. N., and B. Van Roy. 1999. Average cost temporal-difference learning. Automatica 35:1799-1808.
24. Uzsoy, R., C. Lee, and L. A. Martin-Vega. 1994. A review of production planning and scheduling models in the semiconductor industry part II: Shop-floor control. IIE Transactions 26 (6): 44-55.
25. Wein, L. M. 1988. Scheduling semiconductor wafer fabrication. IEEE Trans. on Semiconductor Manufacturing 1:115-130.