具有学习效应的可控加工时间排序问题研究
发布时间：2019-02-09 07:24
【摘要】：随着企业竞争的日益加剧，许多企业尤其是生产型企业不断地寻求更好地生产模式，提高生产效率，降低生产成本，因此排序在企业管理中的作用日益突出。排序与企业管理的有效结合也具有广泛的应用性和实践性，在排序领域内，许多学者研究了不同的学习效应模型，，学习效应指的是随着工人熟练程度的提高使得后加工的工件的时间缩短，本文在之前模型的基础上提出了一个新的学习效应模型，即工件的实际加工时间是其正常的加工时间，工件所排位置（学习效应）及加工时间压缩变量的函数,在此模型下我们分别在单机和平行机中研究了几类排序问题。 本文第一章节重点介绍了排序的相关知识、国内外研究现状、排序的应用及本文的主要研究内容。第二章主要在单机中研究了文中所提出的学习效应模型，证明了极小化时间表长和控制费用问题、极小化总完工时间和控制费用问题、极小化总完工时间偏差和和控制费用问题是多项式时间可解的，给出了相应的算法和数值例子。第三章主要在平行机中讨论了目标函数为极小化总机器负载和控制费用问题、极小化总完工时间和控制费用的问题，并且证明了问题是多项式时间可解的，给出了相应的算法和数值例子。
[Abstract]:With the increasing competition of enterprises, many enterprises, especially production-oriented enterprises, constantly seek better production mode, improve production efficiency and reduce production costs, so ranking plays an increasingly important role in enterprise management. The effective combination of sequencing and enterprise management also has a wide range of application and practicality. In the field of sequencing, many scholars have studied different learning effect models. Learning effect is a new learning effect model based on the former model, that is, the actual processing time of the workpiece is its normal processing time. In this model, we study several sorts of sorting problems in single machine and parallel machine, respectively, for the position of workpiece (learning effect) and the function of processing time compression variable. The first chapter of this paper mainly introduces the related knowledge of sorting, the current situation of research at home and abroad, the application of sequencing and the main research contents of this paper. In the second chapter, the learning effect model proposed in this paper is studied in a single machine. It is proved that the problem of minimizing the length of schedule and the control cost, minimizing the total completion time and the control cost. The problem of minimizing the total completion time deviation and the control cost is polynomial time solvable. The corresponding algorithm and numerical examples are given. In chapter 3, we discuss the problem that the objective function is to minimize the total machine load and control cost, minimize the total completion time and control cost, and prove that the problem is polynomial time solvable. The corresponding algorithms and numerical examples are given.
【学位授予单位】：沈阳航空航天大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：O223
本文编号：2418842
[Abstract]:With the increasing competition of enterprises, many enterprises, especially production-oriented enterprises, constantly seek better production mode, improve production efficiency and reduce production costs, so ranking plays an increasingly important role in enterprise management. The effective combination of sequencing and enterprise management also has a wide range of application and practicality. In the field of sequencing, many scholars have studied different learning effect models. Learning effect is a new learning effect model based on the former model, that is, the actual processing time of the workpiece is its normal processing time. In this model, we study several sorts of sorting problems in single machine and parallel machine, respectively, for the position of workpiece (learning effect) and the function of processing time compression variable. The first chapter of this paper mainly introduces the related knowledge of sorting, the current situation of research at home and abroad, the application of sequencing and the main research contents of this paper. In the second chapter, the learning effect model proposed in this paper is studied in a single machine. It is proved that the problem of minimizing the length of schedule and the control cost, minimizing the total completion time and the control cost. The problem of minimizing the total completion time deviation and the control cost is polynomial time solvable. The corresponding algorithm and numerical examples are given. In chapter 3, we discuss the problem that the objective function is to minimize the total machine load and control cost, minimize the total completion time and control cost, and prove that the problem is polynomial time solvable. The corresponding algorithms and numerical examples are given.
【学位授予单位】：沈阳航空航天大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：O223
【参考文献】
相关期刊论文 前10条
1 王吉波;马力;王利岩;王丹;殷那;;具有学习效应的两个单机排序问题(英文)[J];大连理工大学学报;2008年06期
2 谭云涛;郭波;郑敏;;企业多项目管理中的优先排序问题研究[J];管理工程学报;2005年S1期
3 唐国春;;排序论基本概念综述[J];重庆师范大学学报(自然科学版);2012年04期
4 郭玲;赵传立;;带有公共交货期窗口和加工时间可控的单机排序问题[J];重庆师范大学学报(自然科学版);2012年06期
5 王方;赵传立;;一类带有可控加工时间的单机排序问题[J];重庆师范大学学报(自然科学版);2012年06期
6 范雁鹏;赵传立;;带有交货期和加工时间可控的单机排序问题[J];重庆师范大学学报(自然科学版);2013年03期
7 王吉波;王建军;何平;;具有共同松弛时间的恶化型工件排序问题研究[J];大连理工大学学报;2012年06期
8 越民义,韩继业;n个零件在m台机床上的加工顺序问题(Ⅰ)[J];中国科学;1975年05期
9 唐国春;排序、经典排序和新型排序[J];数学理论与应用;1999年03期
10 罗守成,钱洁;排序在车间生产管理中的应用[J];数学理论与应用;1999年03期
本文编号：2418842
本文链接：https://www.wllwen.com/kejilunwen/yysx/2418842.html
