시스템 특성함수 기반 평균보상 TD(λ) 학습을 통한 유한용량 Fab 스케줄링 근사화
Capacitated Fab Scheduling Approximation using Average Reward TD() Learning based on System Feature Functions
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
In this paper, we propose a logical control-based actor-critic algorithm as an efficient approach for the approximation of the capacitated fab scheduling problem. We apply the average reward temporal-difference learning method for estimating the relative value functions of system states, while avoiding deadlock situation by Banker’s algorithm. We consider the Intel mini-fab re-entrant line for the evaluation of the suggested algorithm and perform a numerical experiment by generating some sample system configurations randomly. We show that the suggested method has a prominent performance compared to other well-known heuristics.
Abstract
In this paper, we propose a logical control-based actor-critic algorithm as an efficient approach for the approximation of the capacitated fab scheduling problem. We apply the average reward temporal-difference learning method for estimating the relative value functions of system states, while avoiding deadlock situation by Banker’s algorithm. We consider the Intel mini-fab re-entrant line for the evaluation of the suggested algorithm and perform a numerical experiment by generating some sample system configurations randomly. We show that the suggested method has a prominent performance compared to other well-known heuristics.
참고문헌 (18)
- Bertsekas,D.P, "Neuro-Dynamic Programming" (1996), Athena Scientific
- Choi,J.Y, "Relative value function approximation for the capacitated re-entrant line scheduling problem", IEEE Trans.Autom.Science and Eng, 2(3), pp.285~299 (2005)
- Choi, J. Y, "Computationally efficient neuro-dynamic programming approximation method for the capacitated re-entrant line scheduling problem", International Journal of Production Research
- Jolliffe, I. T, "Principal Component Analysis" (2002), Springer-Verlag
- Kumar,P.R, "Scheduling manufacturing systems of re-entrant lines, In Stochastic Modeling and Analysis of Manufacturing Systems", pp.325~360 (1994), Springer-Verlag
- Kumar,P.R, "Scheduling semiconductor manufacturing plants", IEEE Control Syst.Mag, 14(6), pp.33~40 (1994)
- Kumar,S, "Fluctuation smoothing policies are stable for stochastic re-entrant lines", Discrete-Event Dynam.Syst.,:Theory and Applicat., 6, pp.361~370 (1996)
- Kumar,S, "Queueing network models in the design and analysis of semiconductor wafer fabs", IEEE Trans.Robot.Automat., 17(5), pp.548~561 (2001)
- Lu,S.H, "Distributed scheduling based on due dates and buffer priorities", IEEE Trans.Autom.Control, 36(12), pp.1406~1416 (1991)
- Lu,S.H, "Efficient scheduling policies to reduce mean and variance of cycle-time in semiconductor manufacturing plants", IEEE Trans.Semicond.Manuf, 7(3), pp.374~385 (1994)
- Puterman, M. L, "Markov Decision Processes : Discrete Stochastic Dynamic Programming" (1994), Wiley
- Reveliotis,S.A, "The destabilizing effect of blocking due to finite buffering capacity in multi-class queueing networks", IEEE Trans.Autom.Control, 45(3), pp.585~588 (2000)
- Reveliotis, S. A, "Real-time management of resource allocation systems" (2005), Springer
- Rossetti,M.D, "A simulation-based approximate dynamic programming approach for the control of the intel mini-fab benchmark model", The proc.of the 2009 winter sim.conf. (2009)
- Sutton,R.S, "Reinforcement Learning(An Introduction)" (1999), MIT Press
- Tsitsiklis,J.N, "Feature-based methods for large scale dynamic programming", Machine Learning, 22, pp.59~94 (1996)
- Tsitsiklis,J.N, "Average cost temporaldifference learning", Automatica, 35, pp.1799~1808 (1999)
- Wein,L.M, "Scheduling semiconductor wafer fabrication", IEEE Trans.Semicond.Manufact., 1(3), pp.115~130 (1988)