Decomposition‐based classified ant colony optimization algorithm for scheduling semiconductor wafer fabrication system

Decomposition‐based classified ant colony optimization algorithm for scheduling semiconductor wafer fabrication system

0.00 Avg rating0 Votes
Article ID: iaor20121182
Volume: 62
Issue: 1
Start Page Number: 141
End Page Number: 151
Publication Date: Feb 2012
Journal: Computers & Industrial Engineering
Authors: , , ,
Keywords: scheduling, heuristics: ant systems, simulation: applications
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.