本文關(guān)鍵詞：具有維護(hù)活動(dòng)的加工時(shí)間可變的排序問題　出處：《沈陽師范大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 排序 退化效應(yīng) 工期 維護(hù)活動(dòng) 交貨時(shí)間

【摘要】：許多年來人們一直在管理科學(xué)、計(jì)算機(jī)科學(xué)、運(yùn)籌學(xué)等領(lǐng)域致力于排序問題的研究。在經(jīng)典排序模型中,工件的加工時(shí)間是固定常數(shù),但在現(xiàn)實(shí)問題中如果對(duì)機(jī)器加以維護(hù),工件的加工時(shí)間可能會(huì)縮短,或者適當(dāng)?shù)姆峙浣o工件一定的資源,使其加工效率提高,加工時(shí)間縮短。本文主要內(nèi)容如下:第一章,著重介紹了該問題的實(shí)際意義,目前研究的進(jìn)展以及本文所做的一些工作。第二章,主要研究在工件的延誤懲罰、提前懲罰等總費(fèi)用之和受限的前提下,最小化資源費(fèi)用的單機(jī)排序問題。所有工件具有一個(gè)公共工期,工件的加工時(shí)間是關(guān)于位置與資源的具有退化效應(yīng)的凸函數(shù)。加工過程中有且僅有一次維護(hù)�？紤]與資源有關(guān)的加工時(shí)間的變化,確定維護(hù)持續(xù)時(shí)間、最優(yōu)資源分配及最優(yōu)公共工期,并給出一個(gè)求得最小資源費(fèi)用的最優(yōu)算法,該算法通過求解指派問題在O(n~4)時(shí)間內(nèi)求得最優(yōu)解。第三章,主要研究具有依賴之前排序的交貨時(shí)間且加工時(shí)間依賴位置的單機(jī)排序問題。每個(gè)工件均具有松弛窗口,工件的實(shí)際加工時(shí)間是不固定函數(shù),與位置相關(guān)。目標(biāo)函數(shù)為總完工時(shí)間、加工時(shí)長(zhǎng)、窗口費(fèi)用、延誤懲罰和提前懲罰的費(fèi)用和,給出了最優(yōu)算法,該算法在O(n~3)時(shí)間內(nèi)求得最優(yōu)解。最后,總結(jié)整篇文章并提出了一些有待解決的相關(guān)排序問題。
[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.
【學(xué)位授予單位】：沈陽師范大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：O223

【參考文獻(xiàn)】

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

1 王吉波;郭苗苗;劉桓;李琳;王丹;;具有依賴開工時(shí)間惡化工件的流水作業(yè)排序問題研究綜述[J];沈陽航空航天大學(xué)學(xué)報(bào);2016年03期

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

3 王吉波;汪佳;牛玉萍;;具有學(xué)習(xí)效應(yīng)的單機(jī)可控加工時(shí)間排序問題研究[J];沈陽航空航天大學(xué)學(xué)報(bào);2014年05期

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

5 孫世杰;;排序問題的簡(jiǎn)短歷史和國(guó)外發(fā)展動(dòng)態(tài)[J];運(yùn)籌學(xué)雜志;1991年01期

，

本文編號(hào)：1394316