Abstract
In this paper, we address and solve the scheduling problem for thin film transistor array (TFT-array) factories. The TAFSP is a variation of parallel machine scheduling problem, which involves the characteristics of process window constraint, machine dedication constraint, mask availability constraint, and mask setup and transportation activities. Hence, we propose an integer programming formulation to solve the TAFSP. To increase the applicability of the integer programming model in real environment, depth-search strategy incorporates with the strong branching rule is adopted to increase the solving efficiency. Computational results show that a good-quality feasible solution can be obtained in an acceptable computational time for a real-world case.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aron, I., Hooker, J.N., Yunes, T.H.: SIMPL: A system for integrating optimization techniques. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 21–36. Springer, Heidelberg (2004)
Chern, C.C., Liu, Y.L.: Family-based scheduling rules of a sequence-dependent wafer fabrication system. IEEE Transactions on Semiconductor Manufacturing. 16(1), 15–25 (2003)
Goldratt, E.M., Cox, J.: The Goal: A Process of Ongoing Improvement. 2nd edn. North River Press, New York (1992)
ILOG Inc.: ILOG OPL Studio 3.5. ILOG Inc. France (2001)
Jain, V., Grossmann, I.E.: Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems. INFORMS Journal on Computing. 13(4), 258–276 (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)
Quirk, M., Serda, J.: Semiconductor Manufacturing Technology. Prentice-Hall, Englewood Cliffs (2001)
Rodošek, R., Wallace, M.G., Hajian, M.T.: A New Approach to Integrating Mixed Integer Programming and Constraint Logic Programming. Annals of Operations Research 86, 63–87 (1999)
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)
Wolsey, L.A.: Integer Programming, 1st edn. Wiley-Interscience, New York (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, A.H.I., Chung, S.H., Huang, C.Y. (2007). Minimizing the Total Completion Time for the TFT-Array Factory Scheduling Problem (TAFSP). In: Gervasi, O., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2007. ICCSA 2007. Lecture Notes in Computer Science, vol 4705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74472-6_63
Download citation
DOI: https://doi.org/10.1007/978-3-540-74472-6_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74468-9
Online ISBN: 978-3-540-74472-6
eBook Packages: Computer ScienceComputer Science (R0)