Abstract
Semiconductor manufacturing has recently attracted an increased attention in process optimization research. Various MILP and constraint programming methods were published to solve the scheduling problem arising in the wet-etching systems. In the present work, improvements are given to these state-of- the-art models, furthermore, the general purpose solver of the S-graph framework (Sanmarti et al. 2002) is applied to wet-etch station scheduling.
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.
