Browse > Article

- Development of an Algorithm for a Re-entrant Safety Parallel Machine Problem Using Roll out Algorithm -  

Baek Jong Kwan (서일대학 산업시스템경영과)
Kim Hyung Jun (서일대학 산업시스템경영과)
Publication Information
Journal of the Korea Safety Management & Science / v.6, no.4, 2004 , pp. 155-170 More about this Journal
Abstract
Among the semiconductor If-chips, unlike memory chips, a majority of Application Specific IC(ASIC) products are produced by customer orders, and meeting the customer specified due date is a critical issue for the case. However, to the one who understands the nature of semiconductor manufacturing, it does not take much effort to realize the difficulty of meeting the given specific production due dates. Due to its multi-layered feature of products, to be completed, a semiconductor product(called device) enters into the fabrication manufacturing process(FAB) repeatedly as many times as the number of the product specified layers, and fabrication processes of individual layers are composed with similar but not identical unit processes. The unit process called photo-lithography is the only process where every layer must pass through. This re-entrant feature of FAB makes predicting and planning of due date of an ordered batch of devices difficult. Parallel machines problem in the photo process, which is bottleneck process, is solved with restricted roll out algorithm. Roll out algorithm is a method of solving the problem by embedding it within a dynamic programming framework. Restricted roll out algorithm Is roll out algorithm that restricted alternative states to decrease the solving time and improve the result. Results of simulation test in condition as same as real FAB facilities show the effectiveness of the developed algorithm.
Keywords
Roll out Algorithm; Re-entrant Parallel Machine; FAB process;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Hurink, J., and Knust, S., 'List Scheduling in a Parallel Machine Environment with Precedence Constraints and Setup Times', Operations Research Letters, Accepted 20 September, 2001
2 Bertsekas, D. P., Tsitsklis, J. N., and Wu, C., 'Rollout Algorithms for Combinatorial Optimization', Journal of Heuristics, vol. 3, pp. 245 - 262, 1997   DOI   ScienceOn
3 Rothkopf, M. H., 'Scheduling Independent Tasks on Parallel Processors', Management Science, vol. 12, pp. 437 - 447, 1966   DOI   ScienceOn
4 Park, Y. S., Kim, S. Y., and Lee, Y. H., 'Scheduling Jobs on Parallel Machines Applying Neural Network and Heuristic Rules', Computers & Industrial Engineering, vol. 38, pp. 189-202, 2000   DOI   ScienceOn
5 Randhawa, S. D., and Smith, T. A., 'An Experimental Investigation of Scheduling Non-Identical, Parallel Processors with Sequence-Dependent Set-up Times and Due dates', International Journal of Production Research, vol. 33, pp. 59 - 69, 1995   DOI   ScienceOn
6 Kim, J. I., and Lee, Y. H., 'Batch Scheduling of Incompatible Job Families with Sequence Independent Setup Times', Journal of the Korean Operations Research and Management Science Society, vol. 26, pp. 69-83, 2001
7 Rajaeskera, J. R., Murr, M. R., and So, K. C., 'A Due-date Assignment Model for a Flow Shop with Application in a Lightguide Cable Shop', Journal of Manufacturing System, vol. 10, pp. 1-7, 1987
8 Lee, Y. H., and Pinedo, M., 'Scheduling Jobs on Parallel Machines with Sequence-dependent Setup Times', European Journal of Operational Research, vol. 100, pp. 464-474, 1997   DOI   ScienceOn