運(yùn)輸能力有限的分段兩階段多車間調(diào)度問題
發(fā)布時(shí)間:2019-02-23 11:21
【摘要】:為有效解決船舶分段生產(chǎn)過程中存在的返工、運(yùn)輸能力限制以及堆場面積約束等問題,分析兩階段多車間調(diào)度的特點(diǎn),構(gòu)建了運(yùn)輸能力有限的分段兩階段多車間調(diào)度模型。模型綜合考慮了分段批次內(nèi)重調(diào)度、批次間的分割合并、分段返工以及緩沖面積和運(yùn)輸能力約束,目標(biāo)是最小化分段的最大完工時(shí)間,建立分段在加工車間、裝配車間以及堆場中的調(diào)度數(shù)學(xué)模型。利用基于路徑選擇的分段兩階段多車間調(diào)度啟發(fā)式算法進(jìn)行求解,并通過數(shù)值實(shí)驗(yàn)以及對(duì)比分析驗(yàn)證了模型的合理性和算法的有效性。
[Abstract]:In order to effectively solve the problems of rework, transportation capacity limitation and yard area constraint in the process of ship segmented production, the characteristics of two-stage multi-workshop scheduling are analyzed, and a segmented two-stage multi-workshop scheduling model with limited transportation capacity is constructed. The model synthetically takes into account the intra-batch rescheduling, segmentation and merging between batches, piecewise rework, buffer area and transportation capacity constraints. The goal of the model is to minimize the maximum completion time of the segment and to establish the segmented workshop. The mathematical model of scheduling in assembly shop and yard. The heuristic algorithm of two-stage multi-job shop scheduling based on path selection is used to solve the problem. The rationality of the model and the validity of the algorithm are verified by numerical experiments and comparative analysis.
【作者單位】: 同濟(jì)大學(xué)機(jī)械與能源工程學(xué)院;
【基金】:國家自然科學(xué)基金(No.70872076) 上?萍紕(chuàng)新行動(dòng)計(jì)劃資助項(xiàng)目(No.11dz1121803)
【分類號(hào)】:U673;TP301.6
,
本文編號(hào):2428774
[Abstract]:In order to effectively solve the problems of rework, transportation capacity limitation and yard area constraint in the process of ship segmented production, the characteristics of two-stage multi-workshop scheduling are analyzed, and a segmented two-stage multi-workshop scheduling model with limited transportation capacity is constructed. The model synthetically takes into account the intra-batch rescheduling, segmentation and merging between batches, piecewise rework, buffer area and transportation capacity constraints. The goal of the model is to minimize the maximum completion time of the segment and to establish the segmented workshop. The mathematical model of scheduling in assembly shop and yard. The heuristic algorithm of two-stage multi-job shop scheduling based on path selection is used to solve the problem. The rationality of the model and the validity of the algorithm are verified by numerical experiments and comparative analysis.
【作者單位】: 同濟(jì)大學(xué)機(jī)械與能源工程學(xué)院;
【基金】:國家自然科學(xué)基金(No.70872076) 上?萍紕(chuàng)新行動(dòng)計(jì)劃資助項(xiàng)目(No.11dz1121803)
【分類號(hào)】:U673;TP301.6
,
本文編號(hào):2428774
本文鏈接:http://sikaile.net/kejilunwen/chuanbolw/2428774.html
最近更新
教材專著