本文選題：單處理機(jī) + 供應(yīng)鏈排序�。� 參考：《曲阜師范大學(xué)》2014年碩士論文

【摘要】：排序論是運(yùn)籌學(xué)中最重要的分支之一。供應(yīng)鏈排序是供應(yīng)鏈管理與排序理論相結(jié)合產(chǎn)生的新領(lǐng)域,它將排序理論應(yīng)用于供應(yīng)鏈管理,集成研究生產(chǎn)調(diào)度和分批配送這兩個(gè)問題。工件帶有惡化效應(yīng)的排序和工件可拒絕的排序是兩種新興起的現(xiàn)代排序模型,它們更接近現(xiàn)實(shí)生活,因而具有很好的研究價(jià)值。本文將上述三類排序問題相結(jié)合,討論了幾個(gè)相關(guān)的排序問題。論文主要結(jié)構(gòu)安排如下： 第一章緒論部分主要介紹了供應(yīng)鏈排序問題、帶有惡化效應(yīng)的排序問題、可拒絕排序,算法的復(fù)雜性以及本文所需要的基礎(chǔ)知識,并對本文的主要工作進(jìn)行了簡要描述。 第二章主要研究了帶有惡化效應(yīng)的單機(jī)供應(yīng)鏈排序問題：一個(gè)制造商為一個(gè)客戶加工工件,每個(gè)工件的加工時(shí)間是其開工時(shí)間的簡單線性增函數(shù),工件加工完之后要安排車輛配送給客戶,完工時(shí)間為工件送達(dá)客戶的時(shí)刻。在同一輛車配送的工件為一批,每一批可同時(shí)配送至多z n個(gè)工件,每配送一批要支付一定的配送費(fèi)用。我們分析了加工時(shí)間為其開工時(shí)間的不同函數(shù),目標(biāo)函數(shù)分別為極小化總完工時(shí)間與總配送費(fèi)用之和、極小化最大延誤時(shí)間與總配送費(fèi)用之和的情形,并分別給出了多項(xiàng)式時(shí)間的最優(yōu)算法。 第三章在第二章的基礎(chǔ)上研究了工件可拒絕的情形。一個(gè)制造商為一個(gè)客戶加工工件,每個(gè)工件既可以被接受加工,也可以被拒絕加工。若工件被拒絕,則要支付一定的拒絕費(fèi)用。若工件被接受,則其加工時(shí)間是其開工時(shí)間的簡單線性增函數(shù),且加工完之后要被安排在車輛運(yùn)送給客戶,完工時(shí)間為工件送達(dá)客戶的時(shí)間。在同一輛車配送的工件為一批,每配送一批要支付一定的配送費(fèi)用,每一批可同時(shí)配送至多z n個(gè)工件。目標(biāo)函數(shù)為極小化被接受工件的總完工時(shí)間、總配送費(fèi)用和被拒絕工件的總拒絕費(fèi)用三者之和,本文對這個(gè)問題給出了運(yùn)行時(shí)間為多項(xiàng)式的動態(tài)規(guī)劃算法。
[Abstract]:The ranking theory is one of the most important branches of operational research. The supply chain ranking is a new field of combination of supply chain management and sorting theory. It applies the ranking theory to the two problems of supply chain management, integrated research on production scheduling and batch distribution. The sorting of workpiece with deteriorating effects and the sorting of workpieces can be rejected are two emerging issues. The modern ranking model, which is closer to the real life, has a good research value. This paper combines the three sorts of sorting problems mentioned above, and discusses several related sorting problems. The main structure of the paper is as follows:
In the first chapter, the introduction part mainly introduces the problem of the ordering of supply chain, the sorting problem with the deterioration effect, the denial of sorting, the complexity of the algorithm and the basic knowledge needed in this paper, and briefly describes the main work of this paper.
The second chapter mainly deals with the problem of single machine supply chain sorting with deteriorating effect: a manufacturer processes the workpiece for one customer. The processing time of each job is a simple linear increase function of its start time. After the work is finished, the vehicle will be assigned to the customer and the job is delivered to the customer at the time of completion. Each batch can deliver up to Z n pieces at the same time, each batch can pay a certain amount of distribution cost per batch. We analyze the different functions of processing time for its start time. The objective function is to minimize the sum of total completion time and total distribution cost, minimization of the maximum delay time and total distribution cost. The optimal algorithm of polynomial time is given.
The third chapter studies the refusal of the workpiece on the basis of the second chapter. A manufacturer processes the workpiece for one customer. Each piece can be processed or refusing to process. If the workpiece is rejected, a certain denial cost is paid. If the workpiece is accepted, the processing time is a simple linear increase in the time of the work. The function, and after processing, should be arranged in the vehicle to the customer, the completion time is the time to deliver the customer. In the same car distribution of the workpiece is a batch, each batch to pay a certain distribution cost, each batch can deliver up to Z n pieces at the same time. The objective function is to minimize the total completion time of the accepted workpiece, the total allocation. The sum of the total cost of rejection and the total rejection cost of the rejected items is given. In this paper, a dynamic programming algorithm with polynomial running time is given for this problem. Three

【學(xué)位授予單位】：曲阜師范大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：O223

【參考文獻(xiàn)】

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

1 宮華;唐立新;;并行機(jī)生產(chǎn)與具有等待時(shí)間限制的成批運(yùn)輸協(xié)調(diào)調(diào)度問題[J];控制與決策;2011年06期

2 王珍;曹志剛;張玉忠;;極小化最大完工時(shí)間及拒絕費(fèi)用的單機(jī)可拒絕分批排序[J];曲阜師范大學(xué)學(xué)報(bào)(自然科學(xué)版);2007年02期

3 張玉忠;曹志剛;;并行分批排序問題綜述[J];數(shù)學(xué)進(jìn)展;2008年04期

4 張峰;唐國春;;工件可拒絕排序問題的研究[J];同濟(jì)大學(xué)學(xué)報(bào)(自然科學(xué)版);2006年01期

相關(guān)博士學(xué)位論文 前1條

1 張利齊;工件可拒絕的機(jī)器排序問題[D];鄭州大學(xué);2012年

，

本文編號：1865222