本文選題：單機排序 + 退化效應　； 參考：《沈陽師范大學》2017年碩士論文

【摘要】：排序問題作為典型的組合最優(yōu)化問題的一種。設有一定數(shù)量的機器和工件或任務。給出所有任務工件的加工時間和加工任務的順序。題目是確定任務在每個處理機上的處理順序,使選定的目標函數(shù)最優(yōu)。在很多經(jīng)典調(diào)度問題中,任務處理所需的時間是給定的常量或是一些隨機變量。然而在實際生產(chǎn)中,任務的加工所需要的時間可能是一個和資源分配、任務在序列中的次序相關的函數(shù),因此便產(chǎn)出現(xiàn)了一些新型的排序題目。第一章,介紹了本文的選題依據(jù),曾經(jīng)提過類似該問題的文章以及本文所做的工作。第二章,考慮包含多個工期窗口和退化維護的單機排問題。設任務的加工時間是一個凸函數(shù)。該凸函數(shù)與分配給這個任務的資源有關,也與所在的次序和退化效應有關。我們的目標是確定最佳維護的位置和多個最佳施工工期時間窗口的大小,分配給每個時間窗口的作業(yè),分配給每個工件的資源和最佳的作業(yè)調(diào)度。盡量減少提前,誤工的總成本,工期窗口的開始時間、大小,資源等構(gòu)成的總用度。用到求解指派問題得出了復雜度為(7)(8)4O n和(7)(8)m(10)3nO的優(yōu)化算法,其中是n工件數(shù)量。第三章,研究帶有公共工期且工件的加工時間是與位置的負荷以及資源有關的排序問題。工件的加工時間是一個和資源分配、工件在排序中的位置以及負荷有關的凸函數(shù),所有任務具有一個公共工期。我們的目標是確定最佳工期的位置、分配給每個任務的資源、任務排序序列,盡量減少提前、誤工的總成本。用到指派問題得出了復雜度為(7)(8)3O n的優(yōu)化算法。最后,總結(jié)本文,并給出通過本文可進一步考慮的題目。
[Abstract]:Scheduling problem is one of the typical combinatorial optimization problems. Having a certain number of machines and workpieces or tasks. The processing time and order of all tasks are given. The problem is to determine the processing order of tasks on each processor to optimize the selected objective function. In many classical scheduling problems, the task processing time is a given constant or some random variables. However, in actual production, the time required for processing tasks may be a function related to the order of resource allocation and tasks in the sequence, so some new sorting problems have emerged. The first chapter introduces the basis of this paper, has mentioned similar issues and the work of this paper. In the second chapter, the single machine scheduling problem including multiple duration windows and degenerate maintenance is considered. Let the processing time of the task be a convex function. The convex function is related to the resources assigned to the task, as well as to the order in which it is located and the degenerate effect. Our goal is to determine the optimal location of maintenance and the size of multiple optimal construction time windows, assign jobs to each time window, assign resources to each job and optimal job scheduling. Try to reduce the total cost of advance, delay, duration window start time, size, total cost of resources, etc. By solving the assignment problem, the optimization algorithms with the complexity of 7 / 8 / 4O / n and 10 / 3nO are obtained, in which the number of jobs is n. In chapter 3, we study the scheduling problem in which the processing time of the workpiece with common duration is related to the load of position and the resource. The processing time of a job is a convex function related to the allocation of resources, the position of the job in the sorting and the load. All tasks have a common duration. Our goal is to determine the optimal time frame, assign resources to each task, sequence tasks, and minimize the total cost of early, delayed work. By using the assignment problem, an optimization algorithm with a complexity of 7 / 8 / 3O / n is obtained. Finally, this paper is summarized, and the topic that can be considered further through this paper is given.
【學位授予單位】：沈陽師范大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：O223

【參考文獻】

相關期刊論文 前6條

1 王洪芳;羅成新;;資源約束下加工時間可變的工期窗口指派問題[J];沈陽師范大學學報(自然科學版);2015年04期

2 王吉波;汪佳;牛玉萍;;具有學習效應的單機可控加工時間排序問題研究[J];沈陽航空航天大學學報;2014年05期

3 趙升華;羅成新;;帶有學習及退化效應和資源分配的交貨期指派的單機排序問題[J];重慶師范大學學報(自然科學版);2014年01期

4 王吉波;劉璐;許揚韜;郭倩;;具有惡化工件的不同工期指派問題研究[J];沈陽航空航天大學學報;2013年05期

5 郭玲;趙傳立;;帶有公共交貨期窗口和加工時間可控的單機排序問題[J];重慶師范大學學報(自然科學版);2012年06期

6 郭曉姣;羅成新;;帶有線性退化工件和退化維護時間的單機窗口排序[J];沈陽師范大學學報(自然科學版);2012年01期

，

本文編號：1935888