具有维护活动的加工时间可变的排序问题

发布时间：2018-01-07 21:35

本文关键词：具有维护活动的加工时间可变的排序问题　出处：《沈阳师范大学》2017年硕士论文　论文类型：学位论文

【摘要】：许多年来人们一直在管理科学、计算机科学、运筹学等领域致力于排序问题的研究。在经典排序模型中,工件的加工时间是固定常数,但在现实问题中如果对机器加以维护,工件的加工时间可能会缩短,或者适当的分配给工件一定的资源,使其加工效率提高,加工时间缩短。本文主要内容如下:第一章,着重介绍了该问题的实际意义,目前研究的进展以及本文所做的一些工作。第二章,主要研究在工件的延误惩罚、提前惩罚等总费用之和受限的前提下,最小化资源费用的单机排序问题。所有工件具有一个公共工期,工件的加工时间是关于位置与资源的具有退化效应的凸函数。加工过程中有且仅有一次维护。考虑与资源有关的加工时间的变化,确定维护持续时间、最优资源分配及最优公共工期,并给出一个求得最小资源费用的最优算法,该算法通过求解指派问题在O(n~4)时间内求得最优解。第三章,主要研究具有依赖之前排序的交货时间且加工时间依赖位置的单机排序问题。每个工件均具有松弛窗口,工件的实际加工时间是不固定函数,与位置相关。目标函数为总完工时间、加工时长、窗口费用、延误惩罚和提前惩罚的费用和,给出了最优算法,该算法在O(n~3)时间内求得最优解。最后,总结整篇文章并提出了一些有待解决的相关排序问题。
[Abstract]:For many years, people have been working in the fields of management science, computer science, operational research and so on. In the classical sorting model, the processing time of the workpiece is a fixed constant. However, in reality, if the machine is maintained, the processing time of the workpiece may be shortened, or the appropriate allocation of certain resources to the workpiece, so that the processing efficiency will be improved. The main contents of this paper are as follows: the first chapter focuses on the practical significance of the problem, the current research progress and some work done in this paper. On the premise that the sum of total cost is limited, the single-machine scheduling problem of minimizing the cost of resources is obtained. All the artifacts have a common time limit. The processing time of workpiece is a convex function with degenerative effect of position and resource. There is only one maintenance in the machining process. Considering the change of processing time related to resources, the maintenance duration is determined. The optimal resource allocation and the optimal common time limit are given, and an optimal algorithm for finding the minimum resource cost is given. The optimal solution is obtained by solving the assignment problem in the time of 4). Chapter 3. This paper mainly studies the single machine scheduling problem which depends on the delivery time and the processing time depends on the position. Each workpiece has a relaxation window and the actual processing time of the workpiece is an indefinite function. The objective function is the sum of total completion time, processing time, window cost, delay penalty and early penalty. In this algorithm, the optimal solution is obtained in the time of 3). Finally, the whole paper is summarized and some related sorting problems are put forward.
【学位授予单位】：沈阳师范大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：O223

【参考文献】