带有多交货期窗口的单机排序问题
发布时间：2018-09-05 18:38
【摘要】：排序作为运筹学领域的一个新兴重要组成部分,现已渗透于当今社会生活的众多方面。排序问题主要研究如何通过合理地安排任务加工顺序使得相关成本最低。本文主要讨论带有多个交货期窗口的单机排序问题。主要内容有以下几个方面:第一章,主要介绍该问题的研究背景、发展现状以及完成本篇论文所搜集到的相关资料。第二章,主要介绍带有多个交货期窗口、退化效应与退化维护活动的单机排序问题。国内外越来越多的研究人员将交货期窗口考虑到排序问题中,本章在研究多交货期窗口的单机排序问题基础上,提出把维修活动以及任务的退化效应考虑到排序问题中。本章假设任务的实际加工时间是一个与该任务加工位置有关的函数,且任意两个交货期窗口不能重叠。对机器的维护过程结束后,机器就恢复到出厂设置,与此同时任务的退化效应也会恢复到最初,本章假定对机器进行维护所需要的时间取决于机器什么时候开始维护的,并将所有待加工的任务分成若干个任务集合,且所有任务集合的个数已知,每一个任务集合共享一个交货期窗口。本章的目标是得到每个任务集合最优交货期窗口的位置、大小和维护活动的最佳位置、以及所有任务的最佳加工顺序使任务的提前惩罚与延误惩罚、每个交货期窗口开始时间及交货期窗口宽度费用之和最小。证明可以通过将该研究问题转化为指派问题求解。第三章,主要介绍带有多个松弛窗口、公共流、维护和资源分配的单机排序问题,并着重考虑在一定的资源约束下如何寻求最优解。本章假定所有的任务都具有一个松弛窗口,窗口的长度随着任务的不同而不同。在工厂生产过程中,为了提高生产效率,会提供给相应的任务一些资源,但资源并不是无限的,资源过多容易使成本加大,通常我们假定资源有限,并且在合适的时间会对机器进行维护,保证机器的正常加工状态。当机器的维护活动结束后,机器会恢复到出厂状态,与此同时任务的退化效应也会恢复到最初。本章的目标是确定任务的松弛窗口的位置、资源分配情况、任务最佳排序使得提前、延误惩罚、松弛窗口的位置、松弛窗口的宽度、时间表长、所有任务的完工时间总和及资源消耗情况之和最小。证明可以将该问题转化为指派问题求解。最后,对全文的内容进行了总结分析。
[Abstract]:Sequencing, as a new important part of operational research, has permeated many aspects of social life. The scheduling problem mainly studies how to make the lowest related cost by reasonably arranging the processing order of tasks. This paper mainly discusses the single machine scheduling problem with multiple due window. The main contents are as follows: the first chapter mainly introduces the research background, development status and relevant data collected in this paper. In chapter 2, the single machine scheduling problem with multiple due window, degradation effect and degradation maintenance activity is introduced. More and more researchers at home and abroad take due window into account. Based on the single machine scheduling problem of multi-due window, this chapter proposes to take the degradation effect of maintenance activities and tasks into account. This chapter assumes that the actual processing time of the task is a function related to the processing location of the task, and that any two due date windows cannot overlap. After the maintenance of the machine is completed, the machine is restored to the factory setting, and the degradation effect of the task is restored to the original. This chapter assumes that the time required for the maintenance of the machine depends on when the machine begins to maintain, All tasks to be processed are divided into several task sets, and the number of all task sets is known, and each task set shares a due date window. The goal of this chapter is to obtain the location, size and optimal location of the optimal due date window for each task set, as well as the optimal processing order for all tasks so that the tasks are punished in advance and delayed. Minimum cost of each delivery window start time and delivery window width. It is proved that the problem can be solved by transforming it into an assignment problem. In chapter 3, we mainly introduce the single machine scheduling problem with multiple relaxation windows, common streams, maintenance and resource allocation, and focus on how to find the optimal solution under certain resource constraints. This chapter assumes that all tasks have a relaxation window, the length of which varies from task to task. In order to improve the production efficiency, some resources are provided to the corresponding task, but the resources are not unlimited, too much resources tend to increase the cost, we usually assume that the resources are limited. And at the right time to maintain the machine, to ensure the normal state of the machine processing. When the maintenance of the machine is finished, the machine will return to the factory state, and the degradation effect of the task will be restored to the original. The objectives of this chapter are to determine the location of the relaxation window of the task, the allocation of resources, the optimal scheduling of tasks, the advance, the penalty for delay, the location of the relaxation window, the width of the relaxation window, and the long schedule, The sum of completion time and resource consumption for all tasks is minimal. It is proved that the problem can be transformed into an assignment problem. Finally, the content of the full text is summarized and analyzed.
【学位授予单位】：沈阳师范大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：O223
本文编号：2225117
[Abstract]:Sequencing, as a new important part of operational research, has permeated many aspects of social life. The scheduling problem mainly studies how to make the lowest related cost by reasonably arranging the processing order of tasks. This paper mainly discusses the single machine scheduling problem with multiple due window. The main contents are as follows: the first chapter mainly introduces the research background, development status and relevant data collected in this paper. In chapter 2, the single machine scheduling problem with multiple due window, degradation effect and degradation maintenance activity is introduced. More and more researchers at home and abroad take due window into account. Based on the single machine scheduling problem of multi-due window, this chapter proposes to take the degradation effect of maintenance activities and tasks into account. This chapter assumes that the actual processing time of the task is a function related to the processing location of the task, and that any two due date windows cannot overlap. After the maintenance of the machine is completed, the machine is restored to the factory setting, and the degradation effect of the task is restored to the original. This chapter assumes that the time required for the maintenance of the machine depends on when the machine begins to maintain, All tasks to be processed are divided into several task sets, and the number of all task sets is known, and each task set shares a due date window. The goal of this chapter is to obtain the location, size and optimal location of the optimal due date window for each task set, as well as the optimal processing order for all tasks so that the tasks are punished in advance and delayed. Minimum cost of each delivery window start time and delivery window width. It is proved that the problem can be solved by transforming it into an assignment problem. In chapter 3, we mainly introduce the single machine scheduling problem with multiple relaxation windows, common streams, maintenance and resource allocation, and focus on how to find the optimal solution under certain resource constraints. This chapter assumes that all tasks have a relaxation window, the length of which varies from task to task. In order to improve the production efficiency, some resources are provided to the corresponding task, but the resources are not unlimited, too much resources tend to increase the cost, we usually assume that the resources are limited. And at the right time to maintain the machine, to ensure the normal state of the machine processing. When the maintenance of the machine is finished, the machine will return to the factory state, and the degradation effect of the task will be restored to the original. The objectives of this chapter are to determine the location of the relaxation window of the task, the allocation of resources, the optimal scheduling of tasks, the advance, the penalty for delay, the location of the relaxation window, the width of the relaxation window, and the long schedule, The sum of completion time and resource consumption for all tasks is minimal. It is proved that the problem can be transformed into an assignment problem. Finally, the content of the full text is summarized and analyzed.
【学位授予单位】：沈阳师范大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：O223
【参考文献】
相关期刊论文 前1条
1 孙世杰;;排序问题的简短历史和国外发展动态[J];运筹学杂志;1991年01期
，本文编号：2225117
本文链接：https://www.wllwen.com/shoufeilunwen/benkebiyelunwen/2225117.html
