本文選題：并行機(jī) + 組批調(diào)度��； 參考：《中南大學(xué)學(xué)報(bào)(自然科學(xué)版)》2017年08期

【摘要】：研究并行批處理機(jī)的組批調(diào)度問題,考慮爐容相同、功率不同的非等同并行機(jī)的總能耗約束,考慮工件尺寸和到達(dá)時(shí)間不同,以最小化最大完工時(shí)間為目標(biāo)建立混合整數(shù)規(guī)劃模型。并行機(jī)組批調(diào)度問題屬于NP-hard問題,采用先組批后調(diào)度的兩階段方式求解。組批階段采用基于FFLPT和BFLPT的啟發(fā)式規(guī)則,調(diào)度階段設(shè)計(jì)帶鄰域搜索的粒子群-遺傳混合算法對(duì)模型進(jìn)行求解。以軋輥生產(chǎn)企業(yè)并行熱處理設(shè)備為研究案例進(jìn)行模型和算法驗(yàn)證,分析不同能耗約束下最大完工時(shí)間優(yōu)化值,并比較算法的優(yōu)化性能。實(shí)驗(yàn)結(jié)果表明:本文算法提高標(biāo)準(zhǔn)遺傳算法的收斂速度,且優(yōu)于2種啟發(fā)式算法;能耗與最大完工時(shí)間之間存在沖突關(guān)系,通過本文的模型和算法得到能耗與最大完工時(shí)間的近似Pareto前沿面,可為企業(yè)的實(shí)際生產(chǎn)提供指導(dǎo)。
[Abstract]:In this paper, the problem of batch scheduling of parallel batch processors is studied. The total energy consumption constraints of parallel machines with the same furnace capacity and different power are considered, and the size and arrival time of the workpiece are considered. A mixed integer programming model is established to minimize the maximum completion time. The parallel unit batch scheduling problem belongs to NP-hard problem. The heuristic rules based on FFLPT and BFLPT are used in the group batch phase and the particle swarm and genetic hybrid algorithm with neighborhood search is designed in the scheduling phase to solve the model. Taking the parallel heat treatment equipment of roll manufacturing enterprise as a case study, the model and algorithm were verified, and the optimal value of the maximum completion time under different energy consumption constraints was analyzed, and the optimization performance of the algorithm was compared. The experimental results show that the proposed algorithm improves the convergence speed of the standard genetic algorithm and is superior to the two heuristic algorithms, and there is a conflict relationship between the energy consumption and the maximum completion time. The approximate Pareto frontier of energy consumption and maximum completion time can be obtained by the model and algorithm in this paper, which can provide guidance for the actual production of enterprises.
【作者單位】： 同濟(jì)大學(xué)電子與信息工程學(xué)院;
【基金】：國家自然科學(xué)基金資助項(xiàng)目(71690234,61273046)~~
【分類號(hào)】：F273;TP18

【相似文獻(xiàn)】

相關(guān)期刊論文 前1條

1 劉樵良;用模糊集分析作業(yè)網(wǎng)絡(luò)[J];信息與控制;1983年01期

，

本文編號(hào)：2039311