【摘要】：近年來,關(guān)于工件外包與多個(gè)代理的排序研究日益深入,首先,制造商并不會(huì)如傳統(tǒng)制造商加工全部工件,而是會(huì)將一部分加工耗時(shí)長(zhǎng)且利潤(rùn)較低的工件外包,其次,現(xiàn)在的排序模型中,制造商往往會(huì)收到多個(gè)代理的訂單,并安排在相同的機(jī)器資源上加工,而不只限于單個(gè)代理,所以,我們主要研究工件外包與多個(gè)代理兩類排序問題,對(duì)這兩類問題的研究極具有現(xiàn)實(shí)意義,論文主要結(jié)構(gòu)安排如下:第一章緒論部分闡述了有關(guān)排序問題的基本內(nèi)容、三參數(shù)表示法,介紹了排序算法及算法復(fù)雜性,并對(duì)文章的相關(guān)研究現(xiàn)狀進(jìn)行了簡(jiǎn)要概括.第二章主要分析帶有外包的供應(yīng)鏈排序問題:制造商為客戶加工工件,假設(shè)僅有一個(gè)供應(yīng)商,一臺(tái)本地機(jī)器和一個(gè)外包商,每個(gè)工件既可以在內(nèi)部加工又可以外包,內(nèi)部加工工件分批運(yùn)輸,車容量有限.本章考慮內(nèi)部加工工件的費(fèi)用為內(nèi)部加工工件的持貨成本,即(加權(quán))總完工時(shí)間,外包費(fèi)用有限.如果所有工件的加工時(shí)間不同,我們考慮目標(biāo)函數(shù)為內(nèi)部加工工件的總完工時(shí)間與運(yùn)輸費(fèi)用,并給出偽多項(xiàng)式時(shí)間算法;如果所有工件的加工時(shí)間相同,我們考慮內(nèi)部加工工件的加權(quán)總完工時(shí)間與運(yùn)輸費(fèi)用這一目標(biāo)函數(shù),給出偽多項(xiàng)式時(shí)間算法.第三章分析了兩個(gè)代理工件帶有惡化效應(yīng)的單機(jī)可拒絕排序問題.代理人A與B有自己的工件集JA和JB,工件集中工件要么被接收并在機(jī)器加工,其中實(shí)際加工時(shí)間只工件開工時(shí)間有關(guān),要么被拒絕,并支付相應(yīng)的拒絕費(fèi)用,其目標(biāo)是在代理人B工件的目標(biāo)函數(shù)fB(對(duì)應(yīng)工件完工時(shí)間的非減函數(shù))與拒絕工件的拒絕費(fèi)用不超過給定值Q的基礎(chǔ)上,使得代理人A接收工件的目標(biāo)函數(shù)fA (對(duì)應(yīng)工件完工時(shí)間的非減函數(shù))與拒絕工件的拒絕費(fèi)用總和最小.對(duì)于各種目標(biāo)函數(shù),我們分別進(jìn)行分析排序,并給出偽多項(xiàng)式時(shí)間算法.
[Abstract]:In recent years, the research on job outsourcing and multi-agent scheduling has become more and more intensive. Firstly, the manufacturer will outsource part of the long-time and low-profit jobs instead of all the jobs as the traditional manufacturer. Secondly, in the current scheduling model, the manufacturer often receives orders from multiple agents and arranges them in the same order. Machine resource processing is not limited to a single agent. Therefore, we mainly study two kinds of scheduling problems: job outsourcing and multi-agent scheduling. The research on these two kinds of scheduling problems is of great practical significance. The main structure of this paper is as follows: Chapter 1: Introduction describes the basic content of scheduling problems, three-parameter representation, and introduces the scheduling. Chapter 2 mainly analyzes the supply chain scheduling problem with outsourcing: the manufacturer processes the workpiece for the customer, assuming that there is only one supplier, one local machine and one outsourcer, each workpiece can be processed internally as well as outsourced and processed internally. This chapter considers that the cost of internal processing is the cost of holding the workpiece, i.e. (weighted) total completion time, and the cost of outsourcing is limited. A pseudo-polynomial time algorithm is presented considering the objective function of the weighted total completion time and the transportation cost for all jobs with the same processing time.Chapter 3 analyzes the single machine rejection scheduling problem with deterioration effect for two proxy jobs.Agents A and B have their own set of jobs JA and JB. The object function fB (the non-subtractive function for the completion time of the job) and the rejection cost of the rejected job do not exceed the given value Q. On the other hand, agent A receives the objective function fA (a non-decreasing function corresponding to job completion time) of the job and minimizes the total rejection cost of the rejected job.
【學(xué)位授予單位】：曲阜師范大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類號(hào)】：O223

【參考文獻(xiàn)】

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

1 王磊;張玉忠;柏慶國(guó);;單機(jī)帶有可拒絕的供應(yīng)鏈排序問題[J];系統(tǒng)科學(xué)與數(shù)學(xué);2014年09期

2 陳立忠;楊棟;張玉忠;;供應(yīng)鏈排序中的外包問題[J];重慶師范大學(xué)學(xué)報(bào)(自然科學(xué)版);2013年05期

3 王磊;王國(guó)慶;易余胤;;有多種運(yùn)輸方式的供應(yīng)鏈排序問題[J];運(yùn)籌學(xué)學(xué)報(bào);2011年03期

4 苗翠霞,張玉忠;極小化加權(quán)總完工時(shí)間的分批排序問題[J];運(yùn)籌學(xué)學(xué)報(bào);2005年02期

，

本文編號(hào)：2242567