【摘要】：排序作為運籌學(xué)領(lǐng)域的一個新興重要組成部分,現(xiàn)已滲透于當(dāng)今社會生活的眾多方面。排序問題主要研究如何通過合理地安排任務(wù)加工順序使得相關(guān)成本最低。本文主要討論帶有多個交貨期窗口的單機(jī)排序問題。主要內(nèi)容有以下幾個方面:第一章,主要介紹該問題的研究背景、發(fā)展現(xiàn)狀以及完成本篇論文所搜集到的相關(guān)資料。第二章,主要介紹帶有多個交貨期窗口、退化效應(yīng)與退化維護(hù)活動的單機(jī)排序問題。國內(nèi)外越來越多的研究人員將交貨期窗口考慮到排序問題中,本章在研究多交貨期窗口的單機(jī)排序問題基礎(chǔ)上,提出把維修活動以及任務(wù)的退化效應(yīng)考慮到排序問題中。本章假設(shè)任務(wù)的實際加工時間是一個與該任務(wù)加工位置有關(guān)的函數(shù),且任意兩個交貨期窗口不能重疊。對機(jī)器的維護(hù)過程結(jié)束后,機(jī)器就恢復(fù)到出廠設(shè)置,與此同時任務(wù)的退化效應(yīng)也會恢復(fù)到最初,本章假定對機(jī)器進(jìn)行維護(hù)所需要的時間取決于機(jī)器什么時候開始維護(hù)的,并將所有待加工的任務(wù)分成若干個任務(wù)集合,且所有任務(wù)集合的個數(shù)已知,每一個任務(wù)集合共享一個交貨期窗口。本章的目標(biāo)是得到每個任務(wù)集合最優(yōu)交貨期窗口的位置、大小和維護(hù)活動的最佳位置、以及所有任務(wù)的最佳加工順序使任務(wù)的提前懲罰與延誤懲罰、每個交貨期窗口開始時間及交貨期窗口寬度費用之和最小。證明可以通過將該研究問題轉(zhuǎn)化為指派問題求解。第三章,主要介紹帶有多個松弛窗口、公共流、維護(hù)和資源分配的單機(jī)排序問題,并著重考慮在一定的資源約束下如何尋求最優(yōu)解。本章假定所有的任務(wù)都具有一個松弛窗口,窗口的長度隨著任務(wù)的不同而不同。在工廠生產(chǎn)過程中,為了提高生產(chǎn)效率,會提供給相應(yīng)的任務(wù)一些資源,但資源并不是無限的,資源過多容易使成本加大,通常我們假定資源有限,并且在合適的時間會對機(jī)器進(jìn)行維護(hù),保證機(jī)器的正常加工狀態(tài)。當(dāng)機(jī)器的維護(hù)活動結(jié)束后,機(jī)器會恢復(fù)到出廠狀態(tài),與此同時任務(wù)的退化效應(yīng)也會恢復(fù)到最初。本章的目標(biāo)是確定任務(wù)的松弛窗口的位置、資源分配情況、任務(wù)最佳排序使得提前、延誤懲罰、松弛窗口的位置、松弛窗口的寬度、時間表長、所有任務(wù)的完工時間總和及資源消耗情況之和最小。證明可以將該問題轉(zhuǎn)化為指派問題求解。最后,對全文的內(nèi)容進(jìn)行了總結(jié)分析。
[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.
【學(xué)位授予單位】：沈陽師范大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：O223

【參考文獻(xiàn)】

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

1 孫世杰;;排序問題的簡短歷史和國外發(fā)展動態(tài)[J];運籌學(xué)雜志;1991年01期

，

本文編號：2225117