Abstract

This study presents a constraint programming (CP) approach for modeling batch operations both in fab (incompatible job families) and backend (compatible job families) which involves the constraints of different job release times, non-identical job sizes, and different batch size. We formulate this scheduling problem as CP and compare with a mixed integer programming (MIP) approach. The models are tested on a set of common problem instances from a paper in the literature. Computational results show that CP outperforms the MIP approach with respect to solution quality and run time.

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 call

Disclaimer: 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.