A Mathematical Model for Sequential Batching Processing Machines Scheduling Problem in TFT-LCD Process

Yu-Ting Tai, Chun-Ying Huang, and Sung-Hsiang Chen


TFT-LCD, Batch scheduling problem, Mixed integer programming


In high-tech manufacturing, to enhance production efficiencies, batch processing machines which can process several jobs simultaneously are commonly used for long-processing time operations. In thin film transistor liquid crystal display (TFT-LCD) manufacturing processes, four sequential batch processing workstations are involved in the cell assembly process which is mainly used to assemble TFT substrates and color filters. Four sequential batch operations make the batch scheduling problem become more complicated. In addition, no existing solution algorithms are shown in previous research work. Consequently, in this paper, we propose a mixed integer programming (MIP) model for four sequential batching processing workstations in which we consider the constraints of limited waiting time, maximal batch size, and setup time between two different product types. In the proposed MIP model, to obtain the detail schedule for four sequential batching processing workstations, we consider the objective function is to minimize total setup times of bottleneck workstation on the premise of satisfying the throughput target. To demonstrate the applicability of the MIP model, a real-world example taken from a cell assembly shop floor in a TFT-LCD factory is provided.

Important Links:

Go Back