臺灣博碩士論文加值系統

由於客製化的時代來臨，面對客戶的多變化需求，企業必須能夠加強製造的彈性及降低製造成本才能夠滿足市場的快速變遷，俾以提升企業競爭力。然而，如何能夠保持製造彈性而又能夠降低生產成本，不僅機具、設備的設計很重要，生產計劃也擔任很重要的角色，於生產計劃中最重要的部份便是生產排程。排程方法的改進是許多學者研究的目標，其中包含考量群組化技術(group technology)、整備時間(setup time)、庫存生產或訂單生產等研究也不在少數，而衡量排程的績效指標也涵蓋了總延遲時間、總流程時間、總完工時間、最大延遲時間……等，排程除了需考慮加工時間外，也因為產品走向少量多樣的方式生產，所以整備時間的增加也慢慢受到重視。因此，本研究透過啟發式演算法發展一考量群組技術(group technology)、整備時間 (setup time)的單機排程方法，並以總延遲時間為排程績效衡量指標，同時以工廠實際訂單測試此演算法，並與一般之排程方式進行驗證、比較分析，希冀其結果可作為往後研究此排程相關範疇研究之參考。

The enterprise must strengthen their flexibility and reduce the manufacturing cost to fit customer’s variable demand. However, how to maintain flexibility and to reduce the manufacturing cost, the equipment along with the production manager play the important roles. The improvement of scheduling method is many researchers’ area. They include the group technology, setup time, inventory and ordering into their research. And the performance of scheduling are the total tardiness time, the total processing time, the total completion time, and the maximum tardiness time...etc. Because the product become more varieties and less quantity, the set-up is getting more important.
This research develops a heuristic method of single-machine scheduling considering group technology, major setup time and minor setup time, and use the total tardiness time for measuring indicator. In addition, the real data from case company are use to test the heuristic method. Finally, the comparison study between the heuristic method and the general dispatching rule are made.

目錄
中文摘要………………………..........……………………………………………………i
英文摘要…………………………….........………………………………………………ii
誌謝………………………...………….............…………………………………………iii
目錄…………………………..………………….....……………………………………iv
表目錄…………………………..…………………………………………………………vi
圖目錄……………………………………………………………………………………viii
第一章 緒論…………………………………………………………………………1
第一節 研究動機…………………………………………...…………………1
第二節 研究目的………………………………………………………2
第三節 範圍與限制…………………………………………..………………2
第四節 研究方法與架構……………………………………………………3
第五節 論文大綱……………………………………………………………3
第二章 文獻探討……………………………………………………………………5
第一節 排程相關理論………………………………………………………5
第二節 單機排程……………………………………………………………12
第三節 群組化生產……………………….…………………………………15
第四節 整備時間……………………………………………………………18
第五節 小結…………………………………………………………………21
第三章 不同排程方法於考量整備時間之單機排程之比較……………………23
第一節 基本假設及問題描述………………………………………………23
第二節 符號說明及問題架構模式…………………………………………24
第三節 啟發式演算法求解…………………………………………………26
第四節 小結…………………………………………………………………28
第四章 實例驗證與分析……………………………………………………29
第一節 基本假設及問題描述…………………………………………….…29
第二節 求解考量整備時間之單機排程方法之比較………………………33
第三節 排程品質之比較………………………………………………39
第四節 小結…………………………………………………………………53
第五章 結論與建議…………………………………………………………………55
第一節 研究結論.........…………………………………………….…55
第二節 研究建議.........…………………………………………………56
參考文獻……………………………………………………………………………57
附錄A LINGO 11.0程式碼(n=15)……………………………...………………………60
附錄B LINGO 11.0測試結果(n=15)…………………………………………………61

[中文部分]
湯璟聖，動態彈性平行機群排程的探討，私立中原大學工業工程研究所碩士論文，民國92年。
林士凱，考量相依整備時間之多目標流程工廠排程，國立雲林科技大學工業管理研究所碩士論文，民國91年。
廖慶榮，相依整備時間之連續性程序工業的排程啟發式方法，行政院國家科學委員會專題研究計畫成果報告，民國85年。
黃榮華，最小化總流程時間之單階群組排程研究，輔仁管理評論，12(1)，147-166，民國94年。
黃榮華，以最大延遲時間為準則之單機群組排程問題，工業工程學刊，15(4)，411-418，民國87年。
張保隆、陳文賢等6 人，生產管理，華泰書局，台北市，民國85年。
陳建良，排程概述，機械工業雜誌，53，122-137，民國84年。
陳俊宏，考慮整備時間與指定途程的群組排程法，澎技學報，6，315-334，民國92年。
陳正芳，基因演算法應用於裝設時間和工作次序相依之流程工廠排程，行政院國家科學委員會專題研究計畫成果報告，民國85年。
楊文華，考量整備時間下之相關排程問題研究，國立台灣科技大學管理研究所碩士論文，民國85年。
吳鴻輝、李榮貴，生產排程之重排程決策問題的文獻探討與分析，中國工業工程學刊，14(2)，147-158，民國86年。
王慶宗，應用群組技術減少生產調整時間之研究--以軟質膠布為例，國立東華大學企業管理研究所碩士論文，民國93年。
汪星明、施禮明，生產管理，五南書局，台北市，民國88年。

[英文部分]
Ali Allahverdi. "A Review of Scheduling research Involving Setup Consideration.", OMEGA l, no. 27, 219-239, 1999.
Baker, K. R." Introduction to Sequencing and Scheduling." John Wiley & Sons, New York, 1974.
Baker, Kenneth R., and Michael J. Magazine."Minimizing Maximum Lateness with Job Families." European Journal of Operational Research 127, no. 1 , 126-39, 2000.
Campbell, H. G., Dudek, R. A., Smith, M. L."A Heuristic Algorithm for the N-Job, M-Machine Sequencing Problem." Management Science 16, no. 1, B630-B637, 1970.
Cheng, T. C. E., C. T. Ng, J. J. Yuan, and Z. H. Liu."Single Machine Scheduling to Minimize Total Weighted Tardiness." European Journal of Operational Research 165, no. 2 , 423-43, 2005.
Franca, Paulo M., Alexandre Mendes, and Pablo Moscato."A Memetic Algorithm for the Total Tardiness Single Machine Scheduling Problem." European Journal of Operational Research 132, no. 1 , 224-42, 2001.
Gupta, Jatinder N. D., and Johnny C. Ho."Scheduling with Two Job Classes and Setup Times to Minimize the Number of Tardy Jobs." International Journal of Production Economics 42, no. 3 , 205-216, 1996.
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P."Optimization by simulated annealing." Science l, no. 220, 71-680, 1983.
Kuroda, Mitsuru, and Zeng Wang."Fuzzy Job Shop Scheduling." International Journal of Production Economics 44, no. 1-2, 45-51, 1996.
Li, Shanling."A Hybrid Two-Stage Flowshop with Part Family, Batch Production, Major and Minor Set-Ups." European Journal of Operational Research 102, no. 1, 142-156, 1997.
Liaee, Mohammad Mehdi, and Hamilton Emmons."Scheduling Families of Jobs with Setup Times." International Journal of Production Economics 51, no. 3 , 165-76, 1997.
Liao, Ching-Jong, and Li-Man Liao."Single Facility Scheduling with Major and Minor Setups." Computers & Operations Research 24, no. 2, 169-178, 1997.
Liu, Z., Yu, W., Cheng, T. C. E. "Scheduling Groups of Unit Length Jobs on Two Identical Parallel Machines." Information Processing Letters 69, no. 26, 275-281, 1999.
Maggu PL, Das G."On 2xn sequencing problem with transportation times of jobs." Pure and Applied Mathematika Sciences 12, no. 1, 1-6, 1980.
Mahmoody, F., Dooly, K. J."Group Scheduling and Order Releasing Review and Foundations for Research."Production Planning and Control 3, no. 1, 70-78, 1992.
Mellor, P. "A Review of Job Shop Scheduling." OR 17, no. 2, 161-71, 1966.
Melouk, Sharif, Purushothaman Damodaran, and Ping-Yu Chang."Minimizing Makespan for Single Machine Batch Processing with Non-Identical Job Sizes Using Simulated Annealing." International Journal of Production Economics 87, no. 2 , 141-47, 2004.
Panwalkar, S.S., Dudek, R.A and Smith, M.L."Sequencing research and the industrial scheduling problem. In: S.E. Elmaghraby, Editor," Symposium on the Theory of Scheduling and Its Applications , 29–38, 1973.
Paul A.Rubin and Gary L.Ragatz."Scheduling in a sequence dependent setup environment wih genetic serch." Computer Ops Re l.22, no.1, 85-99, 1995.
Picard, J.C. and Queryanne, M."The Time-dependent Traveling Salesman Problem and its Application to the Tardiness Problem in One Machine Scheduling." Operations Research l , no.26, 1978, 86-110, 1978.
Schaller, Jeffrey E., and Jatinder N. D. Gupta."Single Machine Scheduling with Family Setups to Minimize Total Earliness and Tardiness." European Journal of Operational Research 187, no. 3, 1050-68, 2008.
Shabtay, Dvir, and Moshe Kaspi. "Minimizing the Total Weighted Flow Time in a Single Machine with Controllable Processing Times." Computers & Operations Research 31, no. 13 , 2279-2289, 2004.
Strusevich, V. A. "Group Technology Approach to the Open Shop Scheduling Problem with Batch Setup Times. " Operations Research Letters 26, no. 4, 181-192, 2000.
Tan, K.C. and Narasimhan, R."Minimizing tardiness on asingle processor with sequence dependent setup times: asimulated annealing approach." Omega, 619-634, 1997.
Webster, Scott, and Kenneth R. Baker."Scheduling Groups of Jobs on a Single Machine." Operations Research 43, no. 4, 692-703, 1995.
Yang, D.L., Chern, M. S."Two-Machine Flowshop Group Scheduling Problem. " Computers and Operations Research 27, no.10, 975-985, 2000.
Zdrzaka, Stanis, xl z, and law. "A Sequencing Problem with Family Setup Times." Discrete Applied Mathematics 66, no. 2 , 161-83, 1996.
Zolfaghari, S., Liang, M."Jointly Solving the Group Scheduling and Machining Speed Selection Problems: a Hybrid Tabu Search and Simulated Annealing Approach." International Journal of Production Research 37 , no. 10, 2377-2397, 1999.