Semiconductor final test scheduling with Sarsa(λ, k) algorithm

Zhicong Zhang

doi:10.1016/j.ejor.2011.05.052

Return

Semiconductor final test scheduling with Sarsa(λ, k) algorithm

2011-12-01

PRE

DOI：10.1016/j.ejor.2011.05.052

Original

Original request for help

Save

Abstract

En 中文

Semiconductor test scheduling problem is a variation of reentrant unrelated parallel machine problems considering multiple resource constraints, intricate {product, tester, kit, enabler assembly) eligibility constraints, sequence-dependant setup times, etc. A multi-step reinforcement learning (RL) algorithm called Sarsa(lambda, k) is proposed and applied to deal with the scheduling problem with throughput related objective. Allowing enabler reconfiguration, the production capacity of the test facility is expanded and scheduling optimization is performed at the bottom level. Two forms of Sarsa(lambda, k), i.e. forward view Sarsa(lambda, k) and backward view Sarsa(lambda, k), are constructed and proved equivalent in off-line updating. The upper bound of the error of the action-value function in tabular Sarsak(lambda, k) is provided when solving deterministic problems. In order to apply Sarsa(lambda, k), the scheduling problem is transformed into an RL problem by representing states, constructing actions, the reward function and the function approximator. Sarsa(lambda, k) achieves smaller mean scheduling objective value than the Industrial Method (IM) by 68.59% and 76.89%, respectively for real industrial problems and randomly generated test problems. Computational experiments show that Sarsa(lambda, k) outperforms IM and any individual action constructed with the heuristics derived from the existing heuristics or scheduling rules. (C) 2011 Elsevier B.V. All rights reserved.

Keywords:

Scheduling

Semiconductor

Reinforcement learning

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.