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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4705 LNCS, pp. 767–778). Springer Verlag. https://doi.org/10.1007/978-3-540-74472-6_63
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
