Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/38407
題名: 以啟發式方法解決具迴流性質之彈性流程式排程問題
Developing Heuristics for the Scheduling Problem With Recirculation on Flexible flow shop
作者: 陳俊吉
Chen, Chun Chi
貢獻者: 陳春龍
Chen, Chuen Lung
陳俊吉
Chen, Chun Chi
關鍵詞: 彈性流程式生產
多工
派工法則
迴流
flexible flow shop
parallel machine
dispatching rule
recirculation
日期: 2008
上傳時間: 8-Apr-2010
摘要: 由於網際網路的發展,使得全球環境變遷,競爭越來越激烈,企業必須面臨快速的需求變化,以及訂單履行時間縮短的問題,因此如何有效的利用生產規劃和現場排程來幫助企業達到較高的訂單達成率和即時反應現場產能一直是製造業努力的目標。\n在排程的問題中,用派工法則來解決排程問題的工廠類型,主要集中在零工式生產系統及流程式生產系統,而進一步加入平行機器概念,即是彈性零工式生產及彈性流程式生產。而現在許多的服務業也都是屬於彈性流程式生產的模式,而且還具有迴流(recirculation)之性質,而之前使用在不具迴流性質之彈性流程式生產的派工法則,在具有迴流性質之彈性流程式生產中是否仍然可以表現良好,是值得探討的。然而更進一步在此具有迴流性質之彈性流程式生產中加入多工的性質,使工作可以被兩個或兩個以上的機器或操作人員進行處理,則運用哪個派工法則讓機器或操作人員選擇工作來進行處理,可以使得選定的目標值有良好的表現,是相當值得研究之問題。
As information technology advances, whole world environmental trend and the competition is more and more intense. The enterprise must face faster demand changes and the problem of shorter order fulfillment. Therefore, how to apply efficient production planning and shop floor scheduling to attain a better order fulfillment and real time production of shop floor capacity is the goal enterprises strive toward.\nThe shop floor scheduling problems using dispatching rules to solve are focus on job shop scheduling problems and flow shop scheduling problems. Moreover, those problems adding the concept of parallel machine will change into flexible job shop scheduling problems and flexible flow shop scheduling problems. Many service industries also belong to this type. In addition, those service industries’ processes also contain the important characteristic of recirculation. Now, there are two problems I would like to solve. First, Whether the dispatching rules which can get good results in flexible flow shop scheduling problems will also get good results in flexible flow shop scheduling problems with recirculation. Second, I add the characteristic of parallel machine into my problem, so it means jobs in the process can be operated by two or more workers. Therefore, which dispatching rule will get better results based on chosen achievement targets in the problem is very interesting to research.
參考文獻: 中文部分 1、湯璟聖,2003,動態平衡機群排程的探討,中原大學,工業工程學系碩士論文。 2、江珮甄,2005,以派工法則求解彈性流程式生產排程問題,台灣大學,資訊管理學系碩士論文。 英文部分 1、Pinedo, Michael., 2002. Scheduling Theory, Algorithms, And Systems, Second Edition, Prentice Hall, pp14-15. 2、Jayamohan, M.S., Rajendran, C., 2000a. “New dispatching rules for shop scheduling : astep forward,” International Journal Production Research, Vol. 38, pp.563-586. 3、 Lim, J.M., 1997. “A genetic algorithm for a single hoist scheduling in the printed-circuit-board electroplating line,” Computers & Industrial Engineering, Vol.33, pp.789-792. 4、Mak, R.W.T., Lam, K.K., Gupta S.R., 1998. “A practical algorithm for cyclic hoist scheduling in a PCB manufacturing,” Journal of Electronics Manufacturing, Vol.8,pp.193-207. 5、Hsieh, J.C., Chang, P.C., Hsu L.C., 2003. “Scheduling of drilling operations in printed circuit board factory,” Computers & Industrial Engineering, Vol. 44, pp.461-473. 6、Brah, S,A., 1996. “A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors,” Production Planning & Control, Vol. 7, pp. 362-373. 7、Subramaniam, V., Lee, G.K., Hong, G.S., Wong, Y.S., Ramesh, T., 2000. “Dynamic selection of dispatching rules for job shop scheduling,” Production Planning & Control,Vol. 11(1), pp.73-81. 8、Rajendran, C., Holthaus, O., 1999. ”A comparative study of dispatching rules in dynamic flowshops and jobshops,” European Journal of Operational Research, Vol. 116,pp.156-170. 9、Conway, R.W., 1965. “Priority dispatching and work-in-process inventory in a job shop,”Journal of Industrial Engineering, Vol. 16, pp. 123-130. 10、Haupt, R., 1989. “A survey of priority rule-based scheduling,” OR Spektrum, Vol. 11,pp.3-16.
55
11、Holthaus, O., Rajendran, C., 1997a. “Efficient dispatching rules for scheduling in a job shop,” International Journal of Production Economics, Vol. 48, pp. 87-105. 12、V.J. Leon. & B. Ramamoorthy., 1997. “An adaptable problem-space-based search method for flexible flow line scheduling,” IIE Transactions Vol.29, pp.115-125. 13、Kurz, Mary E. & Askin, Ronald G., 2003. ” Comparing scheduling rules for flexible flow lines.” International Journal of Production Economics Volume: 85, Issue: 3, pp. 371-388. 14、Quadt, Daniel.& Kuhn, Heinrich., 2007 \"Batch scheduling of jobs with identical process times on flexible flow lines\" International Journal of Production Economics, pp. 385-401 15、S. Bertel.&J.-C. Billaut., 2003\"A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation\" European Journal of Operational Research, Vol. 159,pp.651-662. 16、Ramasesh, R., 1990. “Dynamic job shop scheduling: a survey of simulation research,”OMEGA, Vol. 18(1), pp. 43-57 17、Barman, S., 1997. “Simple priority rule combinations: an approach to improve both flow time and tardiness,” International Journal Production Research, Vol. 35(10),pp.2857-2870.
描述: 碩士
國立政治大學
資訊管理研究所
95356014
97
資料來源: http://thesis.lib.nccu.edu.tw/record/#G0095356014
資料類型: thesis
Appears in Collections:學位論文

Files in This Item:
File Description SizeFormat
601401.pdf98.77 kBAdobe PDF2View/Open
601402.pdf123.16 kBAdobe PDF2View/Open
601403.pdf116.74 kBAdobe PDF2View/Open
601404.pdf152.03 kBAdobe PDF2View/Open
601405.pdf133.97 kBAdobe PDF2View/Open
601406.pdf157.88 kBAdobe PDF2View/Open
601407.pdf196.36 kBAdobe PDF2View/Open
601408.pdf280.95 kBAdobe PDF2View/Open
601409.pdf308.91 kBAdobe PDF2View/Open
601410.pdf137.81 kBAdobe PDF2View/Open
601411.pdf150.03 kBAdobe PDF2View/Open
601412.pdf204.81 kBAdobe PDF2View/Open
601413.pdf611.29 kBAdobe PDF2View/Open
Show full item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.