本文選題：單處理機 + 供應鏈排序��； 參考：《曲阜師范大學》2014年碩士論文

【摘要】：排序論是運籌學中最重要的分支之一。供應鏈排序是供應鏈管理與排序理論相結合產生的新領域,它將排序理論應用于供應鏈管理,集成研究生產調度和分批配送這兩個問題。工件帶有惡化效應的排序和工件可拒絕的排序是兩種新興起的現(xiàn)代排序模型,它們更接近現(xiàn)實生活,因而具有很好的研究價值。本文將上述三類排序問題相結合,討論了幾個相關的排序問題。論文主要結構安排如下： 第一章緒論部分主要介紹了供應鏈排序問題、帶有惡化效應的排序問題、可拒絕排序,算法的復雜性以及本文所需要的基礎知識,并對本文的主要工作進行了簡要描述。 第二章主要研究了帶有惡化效應的單機供應鏈排序問題：一個制造商為一個客戶加工工件,每個工件的加工時間是其開工時間的簡單線性增函數(shù),工件加工完之后要安排車輛配送給客戶,完工時間為工件送達客戶的時刻。在同一輛車配送的工件為一批,每一批可同時配送至多z n個工件,每配送一批要支付一定的配送費用。我們分析了加工時間為其開工時間的不同函數(shù),目標函數(shù)分別為極小化總完工時間與總配送費用之和、極小化最大延誤時間與總配送費用之和的情形,并分別給出了多項式時間的最優(yōu)算法。 第三章在第二章的基礎上研究了工件可拒絕的情形。一個制造商為一個客戶加工工件,每個工件既可以被接受加工,也可以被拒絕加工。若工件被拒絕,則要支付一定的拒絕費用。若工件被接受,則其加工時間是其開工時間的簡單線性增函數(shù),且加工完之后要被安排在車輛運送給客戶,完工時間為工件送達客戶的時間。在同一輛車配送的工件為一批,每配送一批要支付一定的配送費用,每一批可同時配送至多z n個工件。目標函數(shù)為極小化被接受工件的總完工時間、總配送費用和被拒絕工件的總拒絕費用三者之和,本文對這個問題給出了運行時間為多項式的動態(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

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

【參考文獻】

相關期刊論文 前4條

1 宮華;唐立新;;并行機生產與具有等待時間限制的成批運輸協(xié)調調度問題[J];控制與決策;2011年06期

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

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

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

相關博士學位論文 前1條

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

，

本文編號：1865222