「批次加工機台」在許多製造環境中扮演著相當重要的角色，例如液晶顯示器產業的液晶注入(liquid crystal injection)製程工作站中，是由許多相同的平行批次機台所組成，一部機台能同時加工某特定數目的面板。我們主要的排程問題是在含生產順序相關的裝設時間條件下，求得「批量在等候線中的期望延遲時間」及「批次機台的產能利用率」兩者之間的平衡。
機台換線生產時需要很長的裝設時間，若能儘量減少機台換線的次數並增加加工的批次數，就可獲得更高的機台產能利用率。在此兩難下，本論文所設定的目標為最小化總成本。依照Weng and Leachman【1993】所提出「未來到達資訊」的觀念，我們可以利用到達批量時點的預測，做出是否值得立即載入生產的決策。生產決策是由存貨成本、欠貨成本及裝設成本加總的總成本函數來衡量決定。
我們利用隨機塔布搜尋法(stochastic tabu <a href="http://www.ntsearch.com/search.php?q=search&v=56">search</a>, STS)及模擬退火法(simulated annealing, SA)求解此排程問題。最後，為了驗證求解品質並評估效能，我們進行實驗設計來比較兩種方法。結果顯示，隨機塔布搜尋法在最終求解品質的表現上優於模擬退火法；但在初期運算時間的表現上則劣於模擬退火法。

Batch processing machine plays an important role in many manufacturing environments. For example, the workstation in the liquid crystal injecton(LC injection) process in LCD manufacturing consists of identical parallel batch processoing machines. Each machine can process a certain number of panels simultaneously. The objective of this scheduling problem is to balance “the expected delay of lots in queue” and “the capacity utilization of batch machines” under the constraints of sequence dependent setup times.
Machines require different setups. That the less times the machines spend on setups and the larger batch sizes are processed can improve machine utilization. Therefore, to balance the trade-off, we set the objective of the problem is to minimize the total costs. By utilizing “the future arrivals information” as proposed by Weng and Leachman【1993】, we use the arrival <a href="http://www.ntsearch.com/search.php?q=time&v=56">time</a> prediction and make decisions whether we should start a batch or wait. The quality of production decision can be measured by a cost function that is the sum of inventory costs, backorder costs, and setup costs.
Two heuristic <a href="http://www.ntsearch.com/search.php?q=search&v=56">search</a> algorithms, stochastic tabu <a href="http://www.ntsearch.com/search.php?q=search&v=56">search</a> (STS) and simulated annealing (SA), are used to solove the schedule problem. Finally, to validate the quality and to evaluate the speed of the two algorithms, extensive experiments were performed. The result shows that STS is better than SA in terms of the quality of final solutions, but STS is worse than SA at the early state of computation.

英文部分：
Armentano, V. A. and Yamashita, D. S. (2000), “Tabu <a href="http://www.ntsearch.com/search.php?q=search&v=56">search</a> for scheduling on identical parallel machines to minimize mean tardiness”, Journal of intelligent manufacturing, Vol. 11, No. 5, pp. 453-460.
Bailey, N. T. J. (1954), “On queueing processes with bulk service”, Journal of Royal Statistical Society: Series B (Statistical Methodological), Vol. 16, pp. 80-87.
Bilge et al., (2004), “A tabu <a href="http://www.ntsearch.com/search.php?q=search&v=56">search</a> algorithm for parallel machine total tardiness problem”, <a href="http://www.ntsearch.com/search.php?q=Computers&v=56">Computers</a> & Operations Research, Vol. 31, No. 3, pp. 397-414.
Chandru, V., Lee, C. Y., and Uzsoy, R. (1993), “Minimizing total completion <a href="http://www.ntsearch.com/search.php?q=time&v=56">time</a> on batch processing machines”, International Journal of Production Research, Vol. 31, No. 9, pp. 2097-2121.
Cheng, T. C. E., Chen, Z. L., Kovalyov, M. Y., and Lin, B. M. T. (1996), “Parallel-machine batching and scheduling to minimize total completion time”, IIE Transactions, Vol. 28, No. 11, pp. 953-956.
Deb, R. K. and Serfozo, R. F. (1973), “Optimal control of batch service queues”, Advances in Applied Probability, Vol. 5, pp. 340-361.
Dupont, L. and Dhaenens-Flipo, C. (2002), “Minimizing the makespan on a batch machine with non-identical <a href="http://www.ntsearch.com/search.php?q=job&v=56">job</a> sizes: an exact procedure”, <a href="http://www.ntsearch.com/search.php?q=Computers&v=56">Computers</a> & Operations Research, Vol. 29, No. 7, pp. 807-819.
Fowler, J. W., Hogg, G. L., and Phillips, D. T. (1992), “Control of multiproduct bulk <a href="http://www.ntsearch.com/search.php?q=server&v=56">server</a> diffusion/oxidation processes”, IIE Transactions, Vol. 32, No. 2, pp. 84-96.
Fowler, J. W., Hogg, G. L., and Phillips, D. T. (2000), “Control of multiproduct bulk <a href="http://www.ntsearch.com/search.php?q=server&v=56">server</a> diffusion/oxidation processes. Part 2: Multiple servers”, IIE Transactions, Vol. 32, No. 2, pp. 167-176.
Franca et al. (1996), “A tabu <a href="http://www.ntsearch.com/search.php?q=search&v=56">search</a> heuristic for the multiprocessor scheduling problem with sequence dependent setup times”, International Journal of Production Economics, Vol. 43, No. 2-3, pp. 79-89.
Glassey, C. R. and Weng, W. W. (1991), “Dynamic batching heuristic for simultaneous processing”, IEEE Transaction on Semiconductor Manufacturing, Vol. 4, No. 2, pp. 77-82.
Gurnani, H., Anupindi, R., and Akella, R. (1992), “Control of batch processing systems in semiconductor wafer fabrication facilities”, IEEE Transaction on Semiconductor Manufacturing, Vol. 5, No. 4, pp. 319-328.
Jang et al. (2002), “Technology development and production of flat panel displays in Korea”, Proceedings of the IEEE, Vol. 90, No. 4, pp. 501-513.
Jeong B., Kim, S. W., and Lee, Y. J. (2001), “An assembly scheduler for TFT LCD manufacturing”, <a href="http://www.ntsearch.com/search.php?q=Computers&v=56">Computers</a> & Industrial <a href="http://www.ntsearch.com/search.php?q=Engineering&v=56">Engineering</a>, Vol. 41, No. 1, pp. 37-58.
Kim, C. O. and Shin, H. J. (2003), “Scheduling <a href="http://www.ntsearch.com/search.php?q=jobs&v=56">jobs</a> on parallel machines: a restricted tabu <a href="http://www.ntsearch.com/search.php?q=search&v=56">search</a> approach”, International Journal of Advanced Manufacturing Technology, Vol. 22, No. 3-4, pp. 278-287.
Kirkpatrick et al. (1983), “Optimization by simulated annealing”, <a href="http://www.ntsearch.com/search.php?q=Science&v=56">Science</a>, Vol. 220, pp. 671-680.
Kovalyov, M. Y. and Shafransky, Y. M. (1997), “Batch scheduling with deadlines on parallel machines: An NP-hard case”, Information Processing Letters, No. 64, pp. 69-74.
Lee, C. Y., Uzsoy, R., and Martin-Vega, L. A. (1992), “Efficient algorithms for scheduling semiconductor burn-in operations”, Operations Research, Vol. 40, No. 4, pp. 764-775.
Medhi J. (1975), “Waiting <a href="http://www.ntsearch.com/search.php?q=time&v=56">time</a> <a href="http://www.ntsearch.com/search.php?q=distribution&v=56">distribution</a> in a Poisson queue with a general bulk service rule”, <a href="http://www.ntsearch.com/search.php?q=Management&v=56">Management</a> <a href="http://www.ntsearch.com/search.php?q=Science&v=56">Science</a>, Vol. 21, No. 7, pp. 777-782.
Mendes et al. (2002), “Comparing meta-heuristic approaches for parallel machine scheduling problems”, Production Planning & Control, Vol. 13, No. 2, pp. 143-154.
Metropolis et al. (1953), “Equation of state calculations by fast computing machines”, Journal of Chemical Physics, Vol. 21, pp. 1087-1092.
Neuts, M. F. (1967), “A general class of bulk queues with Poisson input”, Annals of Mathematical Statistics, Vol. 38, pp. 759-770.
Park, M. W. and Kim, Y. D. (1997), “Search heuristics for a parallel machine scheduling problem with ready times and due dates”, <a href="http://www.ntsearch.com/search.php?q=Computers&v=56">Computers</a> & Industrial <a href="http://www.ntsearch.com/search.php?q=Engineering&v=56">Engineering</a>, Vol. 33, No. 3-4, pp. 793-796.
Potts, C. N. and Kovalyov, M. Y. (2000), “Scheduling with batching: A review”, European Journal of Operational Research, Vol. 120, No. 2, pp. 228-249.
Uzsoy, R. (1994), “Scheduling batch processing machines with non-identical <a href="http://www.ntsearch.com/search.php?q=job&v=56">job</a> sizes”, International Journal of Production Research, Vol. 32, pp. 1615-1635.
Uzsoy R., Lee, C. Y. and Martin-Vega, L. A. (1994), “A review of production planning and scheduling models in the semiconductor industry. Part II:Shop-floor control”, IIE Transactions, Vol. 26, No. 5, pp. 44-55.
VanderZee, D. J., VanHarten, A., and Schuur, P. C. (1997), “Dynamic <a href="http://www.ntsearch.com/search.php?q=job&v=56">job</a> assignment heuristics for multi-server batch operations: A cost based approach”, International Journal of Production Research, Vol. 35, No. 11, pp. 3063-3093.
Weng, W. W. and Leachman, R. C. (1993), “An improved methodology for real-time production decisions at batch-process workstations”, IEEE Transaction on Semiconductor Manufacturing, Vol. 6, No. 3, pp. 219-225.
Winston, W. L. (1991), Operations research：applications and algorithms, 2nd edition, Pws-kent, Boston, U.S.A..
Zhang, G. C., Cai, X. Q., and Wong, C. K. (2003), “Optimal on-line algorithms for scheduling on parallel batch processing machines”, IIE Transactions, Vol. 35, No. 2, pp. 175-181.

中文部分：
松本正一、角田巿良合著，劉瑞祥譯 (1996)，「液晶之基礎與應用」，國立編譯館，台北。
顧鴻壽 (2001)，「光電液晶平面顯示器技術基礎及應用」，新文京開發出版有限公司，台北。
紀國鐘，鄭晃忠 (2002)，「液晶顯示器技術手冊」，台灣電子材料與元件協會，新竹。
工業技術研究院光電工業研究所 (2002)，「2002光電工業綜論」，工業技術研究院產業經濟與資訊服務中心，新竹。
拓墣產業研究所 (2003)，「2002年光電產業與市場巡弋」，拓墣科技股份有限公司，台北。
拓墣產業研究所 (2003)，「2002年光電產業與市場瞭望」，拓墣科技股份有限公司，台北。
拓墣產業研究所 (2003)，「掌握光電大脈動」，拓墣科技股份有限公司，台北。
王啟仲 (1998)，「半導體製造多頭測試機器排程問題研究」，國立清華大學工業工程研究所碩士論文。
胡雅傑 (2003)，「彩色濾光片生產之批量排程」，國立清華大學工業工程研究所碩士論文。
李俊昇 (2003)，「液晶面板組裝廠批量製程派工法則之設計」，國立交通大學工業工程與管理研究所碩士論文。
展茂光電，http://www.amtc.com.tw/tech.html
統寶光電，http://www.toppoly.com.tw