کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1134597 | 956073 | 2012 | 11 صفحه PDF | دانلود رایگان |

Due to its typical features, such as large-scale, multiple re-entrant flows, and hybrid machine types, the semiconductor wafer fabrication system (SWFS) is extremely difficult to schedule. In order to cope with this difficulty, the decomposition-based classified ant colony optimization (D-CACO) method is proposed and analyzed in this paper. The D-CACO method comprises decomposition procedure and classified ant colony optimization algorithm. In the decomposition procedure, a large and complicate scheduling problem is decomposed into several subproblems and these subproblems are scheduled in sequence. The classified ACO algorithm then groups all of the operations of the subproblems and schedules them according to machine type. To test the effect of the method, a set of simulations are conducted on a virtual fab simulation platform. The test results show that the proposed D-CACO algorithm works efficiently in scheduling SWFS.
► Schedule the semiconductor wafer fabrication system by proposed D-CACO algorithm.
► Divide the large scale scheduling problem into smaller subproblems by decomposition method.
► Schedule every smaller subproblem by classified ACO algorithm.
► The experiment results justified the effectiveness of proposed algorithm.
► Increasing the size of subproblem will improve quality of solution found by the algorithm.
Journal: Computers & Industrial Engineering - Volume 62, Issue 1, February 2012, Pages 141–151