本文選題：批量分割 + 瓶頸資源�。� 參考：《江蘇科技大學》2014年碩士論文

【摘要】：虛擬單元制造系統(tǒng)是在成組技術、傳統(tǒng)制造單元以及動態(tài)單元發(fā)展的基礎上逐漸形成的一種先進生產(chǎn)制造技術。該制造系統(tǒng)不僅能夠靈活適應目前的市場需求，還能夠為生產(chǎn)企業(yè)節(jié)約成本、提高生產(chǎn)效率，其基本思想是在生產(chǎn)車間中不需要改變生產(chǎn)設備資源的物理位置，邏輯上形成完成相關產(chǎn)品生產(chǎn)的虛擬生產(chǎn)單元，該單元中的剩余生產(chǎn)資源可以被其它零件使用，并且一旦任務完成單元內的資源即可被釋放用于其它零部件的生產(chǎn)。但是，有關虛擬單元內約束資源調度問題的研究還不夠完善，多數(shù)虛擬單元調度問題研究忽略了批量分割的方法，因此本文在現(xiàn)有研究的基礎上對虛擬單元內瓶頸資源的批量分割及動態(tài)調度問題進行了詳細的研究。 在其他學者研究的基礎上，本文的內容主要分為兩個方面：首先，為了能夠更好的解決虛擬單元動態(tài)調度中的批量分割問題，實現(xiàn)瓶頸資源的最大化利用，，本文研究了瓶頸設備資源上批量大小的確定，在強調瓶頸設備生產(chǎn)量和提前期重要性的基礎上，提出了基于批量大小算法的線性搜索方法，同時決定生產(chǎn)率和批量大小，并給出了多產(chǎn)品生產(chǎn)的數(shù)值例子來顯示該算法的工作效率。說明在虛擬單元中使用批量分割方法，對于瓶頸資源上批量大小的確定是非常重要的。在這一研究基礎上，本文進一步研究了基于批量分割方法的多階段動態(tài)調度問題，分別考慮了設備成組、批量分割、瓶頸設備資源以及生產(chǎn)過程中的設備利用率，調整時間等多種影響因素下的動態(tài)調度問題�？紤]虛擬單元的運輸特點，選擇最優(yōu)生產(chǎn)運輸路線，設計了相關約束調度模型，使用基于約束規(guī)劃和離散粒子群算法的混合算法進行解決，最終實現(xiàn)了在交貨周期內降低總生產(chǎn)成本的目標，取得了滿意的結果。 為了驗證本文所提出的調度方法在實際制造業(yè)生產(chǎn)中的適用情況，本文詳細介紹了某船舶制造有限公司和含有具體生產(chǎn)問題的管理基本情況，然后將本文提出的相關虛擬單元調度方法應用到該船廠的舾裝管子加工生產(chǎn)車間中去，并提出了有關虛擬單元調度問題的改進方案，通過對比結果顯示，本文提出的解決辦法較其他方法更具有可行性和解決優(yōu)勢。
[Abstract]:Virtual cell manufacturing system (VCMS) is an advanced manufacturing technology based on the development of group technology, traditional manufacturing unit and dynamic cell. The manufacturing system can not only flexibly adapt to the current market demand, but also save costs and improve production efficiency for production enterprises. The basic idea of the system is that the physical position of production equipment resources does not need to be changed in the production workshop. A virtual production unit is logically formed to complete the production of related products. The remaining production resources in the unit can be used by other parts, and once the resources in the task completion unit are released for the production of other parts. However, the research on constrained resource scheduling problem in virtual cell is not perfect, most of the research on virtual cell scheduling problem ignore the method of batch partitioning. Therefore, based on the existing research, the batch partition and dynamic scheduling of bottleneck resources in virtual cells are studied in detail. On the basis of other scholars' research, the content of this paper is mainly divided into two aspects: first, in order to better solve the problem of batch segmentation in dynamic scheduling of virtual cells, realize the maximum utilization of bottleneck resources. In this paper, the determination of batch size on bottleneck equipment resources is studied. On the basis of emphasizing the importance of bottleneck equipment production and lead time, a linear search method based on batch size algorithm is proposed, which determines the productivity and batch size at the same time. A numerical example of multi-product production is given to demonstrate the efficiency of the algorithm. The method of batch segmentation in virtual cell is very important for the determination of batch size on bottleneck resource. On the basis of this research, this paper further studies the multi-stage dynamic scheduling problem based on the batch segmentation method, and considers the equipment group, batch partition, bottleneck equipment resource and equipment utilization ratio in the production process, respectively. Dynamic scheduling problem with adjustment time and other factors. Considering the transport characteristics of virtual cells, the optimal production route is chosen, and the related constraint scheduling model is designed. A hybrid algorithm based on constraint programming and discrete particle swarm optimization is used to solve the problem. Finally, the goal of reducing the total production cost in the delivery cycle is achieved, and satisfactory results are obtained. In order to verify the application of the scheduling method proposed in this paper in the actual manufacturing industry, this paper introduces in detail the basic situation of a ship manufacturing company and the management with specific production problems. Then, the related virtual cell scheduling method proposed in this paper is applied to the outfitting pipe processing workshop of the shipyard, and the improvement scheme of the virtual cell scheduling problem is put forward. The solution proposed in this paper is more feasible and superior than other methods.
【學位授予單位】：江蘇科技大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TP301.6;F426.474

【參考文獻】

相關期刊論文 前7條

1 郭永輝;;基于產(chǎn)出速度的Job-shop型企業(yè)生產(chǎn)作業(yè)計劃與控制方法[J];工業(yè)工程;2008年05期

2 陳斢;;基于瓶頸的制造單元兩階段群組調度程序與仿真[J];成組技術與生產(chǎn)現(xiàn)代化;2011年01期

3 韓文民;葉濤鋒;;混流條件下基于TOC制定生產(chǎn)作業(yè)計劃的關鍵問題:研究現(xiàn)狀及發(fā)展探討[J];江蘇科技大學學報(自然科學版);2005年06期

4 許鵬;王焱;;車間動態(tài)調度方法研究與應用[J];航空制造技術;2009年21期

5 李黎,成曄,袁守華;基于瓶頸分析的優(yōu)先權調度算法研究[J];計算機集成制造系統(tǒng);2005年02期

6 王宏智;;單元制造的功能及應用研究[J];陜西科技大學學報;2006年01期

7 李兵;;基于仿真的制造單元瓶頸分析[J];組合機床與自動化加工技術;2009年01期

本文編號：1907603