Abstract
This paper addresses the capacity allocation problem for photo- lithography area (CAPPA) under an advanced technology environment. The CAPPA problem has two characteristics: process window and machine dedication. Process window means that a wafer needs to be processed on machines that can satisfy its process capability (process specification). Machine dedication means that after the first critical layer of a wafer lot is being processed on a certain machine, subsequent critical layers of this lot must be processed on the same machine to ensure good quality of final products. A production plan, constructed without considering the above two characteristics, is difficult to execute and to achieve its production targets. Thus, we model the CAPPA problem as a constraint satisfaction problem (CSP), which uses an efficient search algorithm to obtain a feasible solution. Additionally, we propose an upper bound of load unbalance estimation to reduce the search space of CSP for searching an optimal solution. Experimental results show that the proposed model is useful in solving the CAPPA problem in an efficient way.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akçali, E., Nemoto, K., Uzsoy, R.: Cycle-Time Improvements for Photolithography Process in Semiconductor Manufacturing. IEEE Transactions on Semiconductor Manufacturing 14(1), 48–56 (2001)
Brailsford, S.C., Potts, C.N., Smith, B.M.: Constraint Satisfaction Problems: Algorithms and Applications. European Journal of Operational Research 119(3), 557–581 (1999)
Chung, S.H., Huang, C.Y., Lee, A.H.I.: Capacity Allocation Model for Photolithography Workstation with the Constraints of Process Window and Machine Dedication. Production Planning and Control (2006) (accepted)
Freuder, E.C., Wallace, R.J.: Constraint Programming and Large Scale Discrete Optimization. American Mathematical Society, Providence (2001)
Hung, Y.F., Cheng, G.J.: Hybrid Capacity Modeling for Alternative Machine Types in Linear Programming Production Planning. IIE Transactions 34(2), 157–165 (2002)
ILOG Inc.: ILOG OPL Studio 3.5. ILOG Inc., France (2001)
Kim, S., Yea, S.H., Kim, B.: Shift Scheduling for Steppers in the Semiconductor Wafer Fabrication Process. IIE Transactions 34(2), 167–177 (2002)
Kishimoto, M., Ozawa, K., Watanabe, K., Martin, D.: Optimized Operations by Extended X-Factor Theory Including Unit Hours Concept. IEEE Transactions on Semiconductor Manufacturing 14(3), 187–195 (2001)
Leachman, R.C., Carmon, T.F.: On Capacity Modeling for Production Planning with Alternative Machine Types. IIE Transactions 24(4), 62–72 (1992)
Lee, Y.H., Park, J., Kim, S.: Experimental Study on Input and Bottleneck Scheduling for a Semiconductor Fabrication Line. IIE Transactions 34(2), 179–190 (2002)
Lustig, I.J., Puget, J.-F.P.: Program Does Not Equal Program: Constraint Programming and Its Relationship to Mathematical Programming. Interfaces 31(6), 29–53 (2001)
Toktay, L.B., Uzsoy, R.: A Capacity Allocation Problem with Integer Side Constraints. European Journal of Operational Research 109(1), 170–182 (1998)
Uzsoy, R., Lee, C.-Y., Martin-Vega, L.A.: A Review of Production Planning and Scheduling Models in the Semiconductor Industry (I): System Characteristics, Performance Evaluation and Production Planning. IIE Transactions 24(4), 47–60 (1992)
Uzsoy, R., Lee, C.-Y., Martin-Vega, L.A.: A Review of Production Planning and Scheduling Models in the Semiconductor Industry (II): Shop-Floor Control. IIE Transactions 26(5), 44–55 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chung, SH., Huang, CY., Lee, A.HI. (2006). Using Constraint Satisfaction Approach to Solve the Capacity Allocation Problem for Photolithography Area. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751595_65
Download citation
DOI: https://doi.org/10.1007/11751595_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34075-1
Online ISBN: 978-3-540-34076-8
eBook Packages: Computer ScienceComputer Science (R0)