本論文針對彩色濾光片生產過程中的RGB製程進行批量排程(Lot sizing and Scheduling)的研究，在RGB製程的環境當中，生產多種不同的產品，每台機台都可以做相同的工作，不同作業需要裝設時間且為順序相關的裝設時間，每種產品經過此製程皆須回流三次以上。
針對此困難的排程問題，本論文提出一個兩階段啟發式演算法，第一階段中，將本問題的生產環境做適度的修正，滿足EOQ模式求解的條件，利用EOQ模式將已知的參數代入公式中求解批量大小，並檢查批量大小是否合理，如果發生不合理解時，將週期長度放大到一個生產週期閒置的時間剛好等於估計的總裝設時間，利用重新修改的週期長度得到合理的批量大小。第二階段中，將每批的產品看成一件工作(job)利用ATCS派工法則，只要平行機台中有任一機台閒置即計算未排程表單中所有工作的優先指標，選取最大的優先指標進行加工，如此循環直到未排程表單中沒有工作為止，即可得到排程解。如果有兩台以上機台同時閒置，則隨機選取其一。
為了驗證求解品質，我們進行實驗設計並以總延遲時間為績效指標來比較十二個兩階段方法，這十二個兩階段方法是由EOQ和固定批量這兩個批量方法與ATCS、ATC、COVERT、EDD、FCFS和MOD_ATC這六個派工法則組合而成的。經由實驗結果可知，EOQ+ATCS和固定批量為200+ATCS表現最好，但是利用EOQ來決定批量大小有一定的公式求解，而固定批量大小卻必須利用試誤法不斷的嘗試才能找出一個較佳的批量大小，因此本論文提出的方法不僅僅方便使用且解題成效也不會比較差。

This study focuses on a lot sizing and scheduling problem in the RGB process which is part of the TFT color filter manufacturing processes. The RGB process produces multiple product types, and there are multiple parallel machines. Also, sequence-dependent setup time is required between different operations, and all product types have reentrant flows.
We develop a two-stage method to solve this difficult scheduling problem. In the first stage, we use EOQ model to determine lot size for every product and modify the lot size if the lot size is infeasible. In the second stage, we solve the scheduling problem by ATCS (Apparent Tardiness Cost with Setups) rule. Whenever one machine becomes free, we compute the priority index for the set of unscheduled jobs, if any. The job with the largest index is selected. If more than one machine is free at same time, we choose one arbitrarily.
Experimental designs are carried out to test the performance of twelve two-stage methods which are combined with two lot sizing methods and six dispatching rules. Results reveal that the two-stage method EOQ+ATCS is easy to use and not worse than the other two-stage methods in terms of the total tardiness of jobs.

Keywords: color filter, parallel machines, sequence-dependent setup time, reentrance, lot sizing and scheduling

Allahverdi, A., Mittenthal, J. (1994),“Scheduling on M parallel machines
subject to random breakdowns to minimize expected mean flow time”, Naval
Research Logistics, No. 41, pp.677-682.
Bilge, U., Kirac, F., Kurtulan, M., Pekgun, P. (2004), “A tabu search algorithm for
parallel machine total tardiness problem”, Computers & Operations Research, No. 31, pp. 397-414.
Campbell, G.M. (1992), “Using short-term dedication for scheduling multiple
products on parallel machines”, Production and Operations Management, No. 1, pp. 295-307.
Carreno, J.J. (1990), “Economic lot scheduling for multiple products on parallel
identical processors”, Management Science, No. 36, pp. 348-358.
Carroll, D.C. (1965), Heuristic Sequencing of Jobs with Single and Multiple
Components, Ph.D. Thesis, Sloan School of Management, MIT.
Dauzèré-Péres, S., Lasserre, J.B. (1994), “Integration of lotsizing and scheduling
decisions in a job-shop”, European Journal of Operational Research, No. 75, pp. 413-426.
Dobson, G.. (1992), “The cyclic lot scheduling problem with sequence-dependent
setups”, Operations Research, No.40, pp. 736-749.
Drexl, A., Kimms, A. (1997), “Lot sizing and scheduling-Survey and extensions”,
European Journal of Operational Research, No. 99, pp. 221-235.
Elmaghraby, S. E. (1978), “The economic lot scheduling problem (ELSP): Review
and extensions”, Management Science, No. 24, pp. 587-598.
Haase, K., Kimms , A. (2000) “Lot sizing and scheduling with sequence dependent
setup costs and times and efficient rescheduling opportunities”, International Journal of Production Economics, No. 66, pp. 159-169.
Hsu, W.L. (1983) “On the general feasibility test of scheduling lot sizes for several
products on one machine”, Management Science, No. 29, pp. 93-105.
Kang, S., Malik, K., Thomas, L.J. (1999), “Lotsizing and scheduling on parallel
machines with sequence-dependent setup costs”, Management Science, No. 45, pp. 273-289.
Kimms, A. (1997), Multi-level Lot Sizing and Scheduling-Methods for Capacitated,
Dynamic, and Deterministic Models, PhysicaVerlag, Heidelberg.
Lee, G..C., Kim Y.D., Kim, J.G.., Choi, S.H. (2003), “A dispatching rule-based
approach to production scheduling in a printed circuit board manufacturing system”, Journal of the Operational Research Society, No. 54, pp. 1038-1049.
Lee, Y.H., Bhaskaran, K., Pinedo, M. (1997), “A heuristic to minimize the total
weighted tardiness with sequence-dependent setups”, IIE Transactions, No. 29, pp. 45-52.
Lee, Y.H., Pinedo, M. (1997), “Scheduling jobs on parallel machines with
sequence-dependent setup times”, European Journal of Operational Research, No. 100, pp. 464-474.
Lin, B.M.T., Jeng, A.A.K. (2004), “Parallel-machine batch scheduling to minimize
the maximum lateness and the number of tardy jobs”, International Journal of Production Economics, No. 91, pp. 121-134.
Mokotoff, E. (2001), “Parallel machine scheduling problems: a survey”,
Asia-Pacific Journal of Operational Research, No. 18, pp. 193-242.
Park, Y., Kim, S., Lee, Y.-H. (2000), “Scheduling jobs on parallel machines
applying neural network and heuristic rules”, Computers & Industrial Engineering, No. 38, pp. 189-202.
Pearn, W.L., Chung, S.H., Chen, A.Y., Yang, M.H. (2004), “A case study on
multistage IC final testing scheduling problem with reentry”, International Journal of Production Economics, No. 88, pp. 257-267.
Pinedo, M., Chao, X. (1999), Operations Scheduling with Applications in
Manufacturing and Services.
Raman, N., Rachamadugu, R.V., Talbot, F.B. (1989), “Real-Time Scheduling of an
Automated Manufacturing Center”, European Journal of Operational Research, No. 40, pp. 222-242.
Salomon, M., Solomon, M.M., Van Wassenhove, L.N., Dumas, Y., Dauzèré-Péres,
S.(1997), “Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the traveling salesman problem with time windows”, European Journal of Operational Research, No. 100, pp. 494-513.
Sivrikaya-Şerifoğlu, F., Ulusoy, G. (1999), “Parallel machines scheduling with
earliness and tardiness penalties”, Computers & Operations Research, No. 26, pp. 773-787.
Vepsalainen, A., Morton, T. (1987), “Priority Rules for Job Shops with Weighted
Tardiness Costs”, Management Science, No. 33, pp. 1035-1047.
Wagner, H.M., Whitin, T.M. (1958), “ Dynamic version of the economic lot size
model”, Management Science, No. 5, pp. 89-96.
Webster, S., Azizoglu, M. (2001), “Dynamic Programming algorithms for
scheduling parallel machines with family setup times”, Computers & Operations Research, No. 28, pp. 127-137.
Yalaoui, F., Chu, C. (2002), “Parallel machines scheduling to minimize total
tardiness”, International Journal of Production Economics, No. 76, pp. 265-279.
胡雅傑 (2003)，「彩色濾光片生產之批量排程」，國立清華大學工業工程研究所
碩士論文。
吳立民 (2004)，「液晶注入之批次加工機台排程」，國立清華大學工業工程研究
所碩士論文。
展茂光電，http://www.amtc.com.tw
台灣工業銀行IBT，http://www.ibt.com.tw
經濟部產業資訊服務網，http://www.itis.org.tw/