| 摘要(英) |
This research mainly discusses the establishment of a production project plan based on the order-to-order method in a mechanical precision processing plant with the production characteristics of odd-work machining, and the PQR is planned according to the annual planning production project plan. Based on the data collection of the individual company, the production schedule was planned according to the current production work order issuance mode, and it was found that the complete set of assembly lacks materials, the production schedule flow rate is low, the storage cost increases, and the PQR demand progress is behind. The processing man-hours generated by the required quantity of component production work orders affect the completion date of each component, and the assembly can be completed without the complete preparation of materials. It also makes it impossible to meet the needs of the PQR package release at each stage. The required quantity in the whole period is assembled and released, which does not meet the expectations of the production project plan.
According to the case, the company conducts research on a single machine and equipment processing process. In the production quantity planning of the required product module, through the analysis logic of this research algorithm, calculate the demand quantity of each component production work order of the product module, and complete the set at each stage Process and produce in batches of assembled quantities. In the production management system, the production work orders are prioritized according to the needs of each stage, and the production supervisor tracks the processing progress and the number of withdrawals. At each stage, the product modules can be assembled and discharged as scheduled and delivered to meet the production project. The needs of the project.
In the future planning, it is hoped to establish a complete production model. Through complete education and training, the production supervisor can plan the production schedule according to the appropriate start-up model, and use the production management system to effectively track the production progress. In addition, in the complex process components, the production work order can also be used in batches to increase the flow rate of production work orders between machines and equipment or between processing plants. Complete various products in quantity and processing time. |
| 參考文獻 |
1.工業技術研究院(2018)。「公版智慧機械雲」應用服務規劃。
http://www.tami.org.tw/wisdom_machine/wisdom_machine-733-3.pdf(上網日期：2020年9月7日)。
2.百德機械股份有限公司(2020)。多面/5軸加工中心機。
https://www.quaser.com/tw/products.php?mode=proDetail&cid=1481260229&pid=1480471266&topcid=1478586127(上網日期：2020年9月15)。
3.呂明山(2018)。機械工業4.0。科技發展，第544期，6-12頁。
4.吳孟霖(2007)。 五軸加工後處理程式之建構與應用。國立台北科技大學製造科技研究所碩士論文。
5.沈國基等人(2005)。進階ERP企業資源規劃:運籌管理。前程文化事業股份有限公司(新北市)。
6.林則孟(2012)。生產計畫與管理。華泰文化事業股份有限公司(台北市)。
7.國立中央大學管理學院 ERP中心(2015)。ERP企業資源規劃導論(第五版)。碁峰資訊股份有限公司(台北市)。
8.陳建良(1995)。排程概述。機械工業雜誌，12月，122-137。
9.莊富安(2020)。金鼠年「鼠咬天開」機械產業迎接曙光到來。2020自動化機械暨智慧製造產業年鑑，18-31頁。
10.黃祥熙(2011)。排程理論。
http://hhuang.npust.edu.tw/ezfiles/146/1146/img/1544/943497907.pdf(上網日期：2020年9月17日)。
11.鼎新電腦股份有限公司(2020)。揭開智慧工廠的真相。
https://www.digiwin.com/tw/dsc/marketing/WB002838/WB00283808.htm(上網日期：2020年9月7日)。
12.經濟部工業局(2019)。智慧機械產業2020-2022專業人才需求推估調查。
https://ws.ndc.gov.tw/001/administrator/18/relfile/6037/9211/b390d424-e6db-41d4-9828-c837388ccc21.pdf(上網日期：2020年9月11日)。
13.蔡尤鏗(2019)。新代科技五軸高速控制器勇闖智慧生產新領域。
https://www.gvm.com.tw/article/69604(上網日期：2020年9月14日)。
英文文獻
14.Back, J-C, Fox, M-S(2000). Constraint-directed techniques for scheduling alternative activities. Artificial Intelligence, 121, 211-250.
15.Barman, S(1997). Simple priority rule combinations: An approach to improve both flow time and tardiness. International Journal of Production Research, 35(10), 2857-2870.
16.Blackstone, J-H, Phillips, D-T, Hogg, G-L(1982). A state-of-the-art survey of dispatching rules for manufacturing job shop operation. International Journal of Production Research, 20(1), 27-45.
17.Conway, R-W, Maxwell, W-L, Miller, L-W (1967). Theory of Scheduling. Boston: Addison-Wesley.
18.Emmons, H(1975). One machine sequencing to minimize mean flow time with minimum number tardy. Naval Research Logistics Quarterly, 22, 585-592.
19.Graham, R-L, Lawler, E-L, Lenstra, J-K, Kan, A-H-G, Rinnooy(1979). Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey. Discrete Optimization II, 5, 287-326.
20.Hertz, A, Widmer, M(1996). An improved tabu search approach for solving the job shop scheduling problem with tooling constraints. Discrete Applied Mathematics, 65, 319-345.
21.Hwang, C-L(1979). Multiple Objective Decision Making - Methods and Applications: A State-of-the-Art Survey (Lecture Notes in Economics and Mathematical Systems, 164. New York: Springer. Berlin.
22.Koksalan, M, Azizoglu, M, Kondakci, Koksalan, S(1998). Minimizing flowtime and maximum earliness on a single machine. IIE Transactions, 30, 192-200.
23.Loukil, T, Teghem, J, Fortemps, P(2007). A multi-objective production scheduling case study solved by simulated annealing. European Journal of Operational Research, 179, 709-722.
24.Nikeas, A, Fountoulakis, A, Forouli, A, Doukas, H(2020). A robust augmented ε-constraint method (AUGMECON-R) for finding exact solutions of multi-objective linear programming problems. Operational Research.
25.Ozguven, C, Ozbakir, L, Yavuz, Y(2010). Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Applied Mathematical Modelling, 34, 1539-1548.
26.Parunak, V-D (1991). Characterizing the manufacturing scheduling problem. Journal of Manufacturing Systems, 10, 241-259.
27.Pinedo, M(1995). Scheduling: Theory, Algorithms, and Systems. New Jersey： Prentice Hall.
28.Rodammer, F-T, White, K-P(1988). A recent survey of production scheduling. IEEE Transactions on Systems，Man，and Cybernetics, 18(6), 841-851.
29.Simos, T(2009). Effective implementation of the ε-constraint method in Multi-Objective Mathematical Programming problems. Applied Mathematics and Computation, 213, 455-465.
30.Soroush, H-M(1999). Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs. European Journal of Operational Research, 133(2), 450-468.
31.Steinhofel, K, Albrecht, A, Wong, C-K(1999). Two simulated annealing-based heuristics for the job shop scheduling problem. European Journal of Operational Research, 118, 524-548.
32.Stevenson, W-J(2018). Stevenson/Operations Management 13e. New York ： McGraw-Hill Education.
33.Tavakkoli-Moghaddam, R, Daneshmand-MehrA, M(2005). A computer simulation model for job shop scheduling problems minimizing makespan. Computers & Industrial Engineering. 48(4), 811-823. |
[Endnote RIS 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
[檢視]
plurk
funp
live
udn
HD
myshare
netvibes
friend
youpush
delicious
baidu
Google bookmarks
del.icio.us
hemidemi
facebook
twitter
google
reddit