參考文獻
1.李俊昇(2003),「液晶面板組裝廠批量製程派工法則之設計」,交通大學工業工程與管理研究所碩士論文。2.李娟如(2001),「TFTLCD面板構造、顯示原理及面板製程介紹」,中華映管公司。
3.林則孟、黃建中、陳子立、陳盈彥(2003),「TFT-LCD多廠區生產鏈之生產規劃架構」,2003產業電子化運籌管理學術暨實務研討會,逢甲大學:台中。
4.林毓淳(2004),「薄膜液晶顯示器組立廠主生產排程快速規劃系統之設計」,交通大學工業工程與管理研究所碩士論文。5.許家豪(2004),「2005年TFT產業趨勢與展望」,巨亨網月報,2004年11月25日。
6.彭俊昌(2005),「液晶面板組立廠投料與派工模擬分析」,清華大學工業工程與工程管理研究所碩士論文。7.蔡秉宏(2003),「液晶面板組裝廠產能配置模組之建構」,交通大學工業工程與管理研究所碩士論文。8.潘志聖、徐潤忠與許家禔,「成功案例分享」,TOC訂單履約管理機制整體解決方案研討會,2004年5月27日,煙波飯店:新竹。
9.Atwater, J.B. and Chakravorty, S.S. (2002), “A Study of the Utilization of Capacity Constrained Resources in Drum-Buffer-Rope Systems,” Production and Operations Management, Vol. 11, No. 2, pp. 259-273.
10.Azizoglu, M. and Kirca, O. (1998), “Tardiness Minimization on Parallel Machines” International Journal of Production Economics, Vol. 55, pp. 163-168.
11.Alidaee, B. and Rosa, D. (1997), “Scheduling Parallel Machines to Minimize Total Weighted and Unweighted Tardiness,” Computers and Operations Research, Vol. 24, No. 8, pp. 775-788.
12.Corbett, T. and Csillag, J.M. (2001), “Analysis of the Effects of Seven Drum-Buffer-Rope Implementations,” Production and Inventory Management Journal, Third/Fourth Quarter, pp. 17-23.
13.Cheng, T.C.E. and Diamond, J.E. (1995), “Scheduling Two Job Classes on Parallel Machines,” IIE Transactions, Vol. 27, pp. 689-693.
14.Daniel, V. and Guide, R., Jr., (1997), “Scheduling with Priority Dispatching Rules and Drum-Buffer-Rope in a Recoverable Manufacturing System,” International Journal of Production Economics,Vol. 53, No. 1, pp. 101-116.
15.Daniel, V. and Guide, R., Jr., (1996), “Scheduling Using Drum-Buffer-Rope in a Remanufacturing Environment,” International Journal of Production Research, Vol. 34, No. 4, pp. 1081-1091.
16.Eduardo, D.S. and Malave, C.O. (2004), “Simulated Annealing for Parallel Machine Scheduling with Split Jobs and Sequence-Dependent Set-Ups,” International Journal of Industrial Engineering, Vol. 11, No. 1, pp. 43-53.
17.Goldratt, E.M. (1986), The Goal, 2nd revised edition, Croton-on-Hudson, New York: North River Press.
18.Goldratt, E.M. (1990), The Race, Croton-on-Hudson, New York: North River Press.
19.Goldratt, E.M. (1990), The Haystack Syndrome, Croton-on-Hudson, New York: North River Press.
20.Goldratt, E. M. and Fox, R. E. (1986), The Race, Croton-on-Hudson, New York: North River Press.
21.Kim, Y.D., S.O. Shim, S.B. Kim, and Choi, Y.C. (2004), “Parallel Machine Scheduling Considering a Job-Splitting Property,” International Journal of Production Research, Vol. 42, No. 21, pp. 4531-4546.
22.Ronen, B. and Starr, M.K. (1990), “Synchronous Manufacturing as in OPT:from Practice to Theory,” Computers and Industrial Engineering, Vol. 18, No. 4, pp. 585-600.
23.Suer, G. A., F. Pico and Santiago, A. (1997), “Identical Machine Scheduling to Minimize the Number of Tardy Jobs When Lot-splitting is Allowed,” Computers and Industrial Engineering, Vol. 33, No. 1-2, pp. 277-280.
24.Shoemaker, L.J. (1995), “It’s a Jungle Out There-So Listen to the DRUM Beat!,” 1995 APICS Constraints Management Symposium and Technical Exhibit, April 26-28, Phoenix, AZ, USA, pp. 119-139.
25.Schragenheim, E. and Ronen, B. (1990), “Drum-Buffer-Rope Shop Floor Control,” Production and Inventory Management Journal, Third Quarter, pp. 18-23.
26.Serifoglu, F.S. and Ulusoy, G. (1999), “Parallel Machine Scheduling with Earliness and Tardiness Penalties,” Computers and Operations Research, Vol. 26, No. 8, pp. 773-787.
27.Sarin, S.C., S. Ahn, and Bishop, A.B. (1988), “An Improved Branching Sheme for the Branch Bound Procedure of Scheduling n Jobs on m Parallel Machines to Minimize Total Weighted Flowtime,” International Journal of Production Research, Vol. 26, No. 7, pp. 1183-1191.
28.Tahar, D.N., F. Yalaoui, C. Chu, and Amodeo, L. (2006), “A Linear Programming Approach for Identical Parallel Machine Scheduling with Job Splitting and Sequence-Dependent Setup Times,” International Journal of Production Economics, Vol. 99, No. 1-2, pp. 63-73.