云制造环境下考虑机器单位租用成本的同类机调度问题研究

发布时间：2018-06-17 22:42

本文选题：同类机 + 调度　；参考：《合肥工业大学》2017年硕士论文

【摘要】：本文研究的内容是云制造环境下考虑机器租用成本的同类机调度问题。新兴信息技术与制造业相结合,是现代先进制造业的典型特点之一。在“互联网+”环境下,通过将制造资源虚拟化和网络发布与发现,实现制造资源使用权的线上交易,能够促进制造资源的共享和有效利用,因此产生了云制造这一新型的制造模式,对国家及制造型企业均具有重要意义。在云制造这一新型制造模式下,生产资料的使用权和所有权相分离,越来越多的生产资料以租用方式进行生产,因此调度的过程必须考虑机器的租用成本。在此背景下,本文将机器租用成本引入到的同类机调度领域中,调度目标是在总成本预算?U范围内,最小化makespan,以期达到生产成本与生产效率的平衡。首先引入性价比的概念,定义机器成本与速度的比值定义为性价比,先对性价比进行严格约束,假定性价比与速度正相关,所有作业都是普通作业,即作业的加工时间不同。同时考虑了不可中断和可中断两种情形,通过对问题进行分析可知该问题是NP-hard的,针对可中断情形,提出了最优算法3.1,并证明了算法是最优的;针对不可中断情形,提出了启发式算法3.2,并证明了算法的可行性。最后通过大量的计算机模拟实验,验证了这两个算法的有效性。接着,针对这一情况,本文进一步放松约束条件,去掉了对性价比的约束,使其更加贴近实际。对问题进行了数学建模,结合LPT算法,从四个不同角度为不可中断情况构造了四种启发式算法,分别分析了它们的时间复杂度,并进行了大规模的计算机模拟实验,验证了这些算法的有效性。
[Abstract]:In this paper, we study the scheduling problem of the same kind of machine under cloud manufacturing environment considering the machine rental cost. The combination of new information technology and manufacturing industry is one of the typical characteristics of modern advanced manufacturing industry. In the "Internet" environment, the sharing and effective utilization of manufacturing resources can be promoted by virtualizing manufacturing resources and publishing and discovering the manufacturing resources. Therefore, cloud manufacturing, a new manufacturing model, is of great significance to the country and manufacturing enterprises. Under the new manufacturing mode of cloud manufacturing, the right to use and the ownership of the means of production are separated, and more means of production are produced by leasing, so the scheduling process must consider the rental cost of the machine. Under this background, this paper introduces the machine rental cost into the same machine scheduling field. The scheduling goal is to minimize makespanwithin the total cost budget, in order to achieve the balance between production cost and production efficiency. Firstly, the concept of performance-to-price ratio is introduced, and the ratio of machine cost to speed is defined as performance-price ratio. First, the cost performance ratio is strictly constrained. Assuming that the cost performance ratio is positively related to speed, all operations are ordinary operations, that is, the processing time of the operations is different. The problem is NP-hard by analyzing the problem, and the optimal algorithm 3.1 is proposed for the interruptible case, and the algorithm is proved to be optimal, and for the non-interruptible case, the algorithm is proved to be optimal. A heuristic algorithm 3.2 is proposed and the feasibility of the algorithm is proved. Finally, the effectiveness of the two algorithms is verified by a large number of computer simulation experiments. Then, in view of this situation, this paper further loosens the constraint condition, removes to the performance price ratio restriction, causes it to be closer to the reality. In this paper, the mathematical model of the problem is established. Combined with the LPT algorithm, four heuristic algorithms are constructed from four different angles, their time complexity is analyzed, and a large scale computer simulation experiment is carried out. The validity of these algorithms is verified.
【学位授予单位】：合肥工业大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：F274

【相似文献】