Abstract
In semiconductor wafer manufacturing, furnaces are mainly used for diffusion and deposition operations. During operations, wherever a furnace becomes available, scheduling the next batch deals with decisions on a batch which operation to process next and how many wafer lots to group the batch. To resolve the mentioned scheduling problem of the furnace where existing multi-products and different due dates, a heuristic dynamic scheduling algorithm called WCRHA (weighted cost rate heuristic algorithm) is presented to minimize the objective value of the waiting cost per unit time based on due date constraints. Simulation results show that the proposed algorithm is valid and feasible. Compared with the previous dynamic scheduling algorithms, it is more efficient in ensuring delivery and reducing completion time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
