本文選題：車間調(diào)度　切入點(diǎn)：資源彈性約束　出處：《西南交通大學(xué)》2016年博士論文　論文類型：學(xué)位論文

【摘要】：調(diào)度問題廣泛存在于實際生產(chǎn)過程中,且調(diào)度問題一般多屬于NP-hard問題,求解極其復(fù)雜,也一直吸引著國內(nèi)外眾多學(xué)者在這一領(lǐng)域進(jìn)行探索與研究。在理論研究上,對車間調(diào)度的研究主要針對時間這一角度進(jìn)行展開,考慮對資源進(jìn)行合理地安排與分配,同時對生產(chǎn)進(jìn)度進(jìn)行合理安排,使生產(chǎn)制造任務(wù)的實際完成時間能夠最短。在現(xiàn)有文獻(xiàn)中已對這類問題進(jìn)行了大量的探索與研究,設(shè)計了眾多的最優(yōu)化算法。然而在實際的調(diào)度執(zhí)行過程中,意料之外的不確定因素是不可避免的,如原材料沒能按時送達(dá),外包任務(wù)發(fā)生工期延誤和多個制造任務(wù)運(yùn)行下的資源沖突等,這些因素使制造任務(wù)面臨交貨期違約的風(fēng)險。如何將存在交貨期違約風(fēng)險的制造任務(wù)通過彈性資源的合理調(diào)度,進(jìn)而優(yōu)化進(jìn)度計劃,合理減輕或者消除交貨期違約所造成的違約損失,實現(xiàn)制造活動的成本最低化、收益最大化,就成為新時代生產(chǎn)管理人員時常面臨的困境。針對上述問題,依據(jù)前人的研究成果,本文對調(diào)度問題進(jìn)行拓展研究。圍繞著調(diào)度最優(yōu)化的目標(biāo),引出了生產(chǎn)調(diào)度研究領(lǐng)域中的資源彈性約束,以解決制造任務(wù)在面臨交貨期違約風(fēng)險時的優(yōu)化調(diào)度問題。第一章,主要闡述了本研究課題的背景與意義。同時概述了調(diào)度問題的主要內(nèi)容,綜述了在車間調(diào)度優(yōu)化領(lǐng)域的國內(nèi)外研究現(xiàn)狀,并進(jìn)行了總結(jié)與分析,在給出了論文的章節(jié)結(jié)構(gòu)的基礎(chǔ)上,進(jìn)而提出論文所要研究的主要內(nèi)容。第二章,研究了車間調(diào)度問題研究的總體技術(shù)框架。首先描述了需要求解的問題,給出其對應(yīng)研究的數(shù)學(xué)模型;然后,研究了求解問題的總體技術(shù)框架,確定了總體研究方針,給逐漸深入探究各章節(jié)問題提供思路。第三章,對以任務(wù)粒度控制與人員柔性為基礎(chǔ)的車間調(diào)度問題進(jìn)行研究,采用任務(wù)時序邏輯關(guān)系和粒度控制方法對復(fù)雜制造任務(wù)進(jìn)行了科學(xué)合理的分解,然后,在考慮人員彈性約束的基礎(chǔ)上,實現(xiàn)了任務(wù)和資源的匹配優(yōu)化,得到了有效的決策方案。第四章,研究了機(jī)器資源彈性約束下的柔性車間調(diào)度問題,采用析取圖方法表示柔性車間調(diào)度問題,提出兩種群蟻群算法分析機(jī)器彈性對調(diào)度效率的影響,以此來探索最經(jīng)濟(jì)有效的資源配置方式實現(xiàn)最優(yōu)的調(diào)度效率,這對企業(yè)提升制造系統(tǒng)效率具有重要的指導(dǎo)意義。第五章,對于以最大完工時間最小為調(diào)度目標(biāo)的惡化工件彈性調(diào)度的問題,基于此類問題的突出特性,諸如針對不同的惡化率和不同的設(shè)備惡化情況進(jìn)行了分類研究,并有針對性地提出了求解該問題的一種改進(jìn)遺傳算法,結(jié)果表明,惡化效應(yīng)與調(diào)度效果之間存在著一種相互作用關(guān)系。第六章,對于以最大完工時間最小為調(diào)度目標(biāo)的人員彈性調(diào)度問題,基于此類問題的突出特性,諸如針對不同的人員彈性度分類研究,并有針對性地提出了求解該問題的一種改進(jìn)模擬退火遺傳算法,最后得到了人員彈性度和調(diào)度結(jié)果這兩者是互相影響的關(guān)系的探究結(jié)果。第七章,對全文工作和創(chuàng)新點(diǎn)進(jìn)行了總結(jié),為進(jìn)一步的研究指明了方向。
[Abstract]:Scheduling problems are widely used in the actual production process, and the general scheduling problem is a NP-hard problem, is very complex, it has attracted many domestic and foreign scholars to explore and research in this field. In theory, the research on job shop scheduling mainly aims at the time this way, considering the reasonable arrangement with the allocation of resources, at the same time on the production schedule for reasonable arrangement, the production tasks of the actual completion of the shortest time can. In the existing literature on this issue has made a lot of exploration and research, the optimization design of many. However in the actual execution process, contrary to expectation uncertainty it is inevitable, such as raw materials could not be delivered on time, outsourcing task resource conflict delay and multiple manufacturing tasks under the operation, these factors make the manufacturing task The risk of default delivery. How there will be manufacturing task delivery default risk through reasonable scheduling of flexible resource, and to optimize the schedule, reduce or eliminate the reasonable default losses caused by the breach of the delivery period, the lowest cost of manufacturing activities, to maximize the benefits, has become the new era of production management personnel often face trouble. In view of the above problems, on the basis of previous research results, this paper studies the scheduling problem. Based on the optimization of the scheduling, resource production scheduling leads to elastic constraints in the research field, in order to solve the scheduling problem of manufacturing tasks in the face of delivery when the risk of default. The first chapter mainly expounds the background and significance this study provides an overview of the main content. At the same time scheduling problems, summarized the research present situation in the workshop scheduling field at home and abroad, and sums up With the analysis, based on the chapter structure of the paper are given on and then put forward the main content of this paper is to study the general technical framework. The second chapter studies the research on job shop scheduling problem. Firstly describes the problem to be solved, gives the mathematical model of the corresponding research; then, the overall technical framework of solving problems the study, to determine the overall policy to gradually explore the chapters provide ideas. The third chapter is to study the shop scheduling problem with task granularity and flexible personnel as the foundation, the task of sequential logic relations and size control method of complex manufacturing task is decomposed, and then the scientific and reasonable, taking into consideration personnel of elastic restraint, realizes the optimized matching of tasks and resources, making effective scheme is obtained. The fourth chapter studies the flexible job shop scheduling resource constrained elastic machine The problem, using the disjunctive graph representation of flexible job shop scheduling problem, put forward two population ant colony algorithm analysis of the effect of elasticity on the machine scheduling efficiency, so as to explore the most effective way to achieve optimal allocation of resources for enterprises to improve the scheduling efficiency, has the important guiding significance for manufacturing efficiency of the system. In the fifth chapter, the maximum completion time the minimum scheduling objective is the deterioration of the workpiece elastic scheduling problem, highlighting the characteristics of such problems based on devices such as for different deterioration rates and different deterioration are studied, and put forward to a kind of improved genetic algorithm to solve this problem, the results show that an interaction relationship exists between the deterioration effect and regulation effect. In the sixth chapter, in order to minimize the maximum completion time for the scheduling target personnel elastic scheduling problem, based on the features of this kind of problem According to different people, such as elastic classification research, and puts forward a kind of improved simulated annealing genetic algorithm for solving the problem, and finally get the personnel flexibility and scheduling results which is to explore the relationship of mutual influence. The seventh chapter of the thesis, the work and innovation points are summarized and pointed out the direction for further research.

【學(xué)位授予單位】：西南交通大學(xué)
【學(xué)位級別】：博士
【學(xué)位授予年份】：2016
【分類號】：F273

【參考文獻(xiàn)】

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

1 朱傳軍;宋文家;張超勇;曹靜;朱孟周;;基于維修時間窗的柔性作業(yè)車間調(diào)度優(yōu)化研究[J];中國機(jī)械工程;2016年10期

2 張國輝;吳立輝;聶黎;王永成;;考慮機(jī)器故障的柔性作業(yè)車間魯棒調(diào)度方法[J];系統(tǒng)仿真學(xué)報;2016年04期

3 謝芳;徐哲;于靜;;柔性資源約束下的項目調(diào)度問題雙目標(biāo)優(yōu)化[J];系統(tǒng)工程理論與實踐;2016年03期

4 孫斌;吉衛(wèi)喜;堵士俊;錢德成;;基于改進(jìn)螢火蟲算法的多資源多目標(biāo)車間調(diào)度問題研究[J];現(xiàn)代制造工程;2016年02期

5 李明;徐哲;;基于均衡優(yōu)化的項目多技能人力資源指派與調(diào)度方法[J];工業(yè)工程;2016年01期

6 黃健倉;;建設(shè)企業(yè)多項目管理中的資源調(diào)度問題研究[J];中國軟科學(xué);2016年01期

7 周輔疆;陳宏文;王斌;顧峗;吳海;;改進(jìn)柔性資源約束項目調(diào)度模型與粒子群算法[J];火力與指揮控制;2016年01期

8 曾斌;姚路;胡煒;楊光;;考慮不確定因素影響的保障任務(wù)調(diào)度算法[J];系統(tǒng)工程與電子技術(shù);2016年03期

9 張國輝;王永成;張海軍;;多階段人機(jī)協(xié)同求解動態(tài)柔性作業(yè)車間調(diào)度問題[J];控制與決策;2016年01期

10 趙亞玲;葛茂根;扈靜;張銘鑫;張璽;;柔性生產(chǎn)中基于人員任務(wù)匹配度的人員調(diào)度[J];合肥工業(yè)大學(xué)學(xué)報(自然科學(xué)版);2015年02期

，

本文編號：1571968