本文選題：激活費用 + 恒速機��； 參考：《曲阜師范大學》2016年碩士論文

【摘要】：本文主要研究在資源有限前提下帶激活費用的恒速機上工件的博弈排序問題.機器初始狀態(tài)未被激活,激活每一臺機器都會產(chǎn)生一定的激活費用.沒有中心權力者來控制排序,每一個工件相當于一個局中人,它們會極小化個體成本來選擇機器進行加工,其中每一個工件的個體成本是它選擇的機器的完工時間與其所要承擔的那部分激活費用之和.用無序代價(POA)來衡量最差的納什均衡(NE)排序的社會成本與最優(yōu)值之間的差異.本文將有限臺恒速機、激活費用綜合考慮,分別對帶激活費用的兩臺和m臺恒速機的博弈排序問題的不同目標函數(shù)進行了研究.第一章主要介紹了排序問題、博弈理論和博弈排序問題的研究背景、相關理論知識和研究現(xiàn)狀,并簡要說明了本文的主要研究成果及創(chuàng)新點.第二章主要研究帶激活費用的兩臺恒速機上工件的博弈排序問題的模型(?).模型中,兩臺機器的速度分別為1和α,機器的激活費用B與其速度相同.社會成本(?)為所有工件的個體成本Cj之和,目標為極小化社會成本.通過對模型POA的分析,我們得到了POA的上界α+1,證明并給出了POA下界α-1的一個實例.第三章主要研究帶相同激活費用的m臺恒速機上工件的博弈排序問題的兩個模型,即(?).模型中,有m臺速度不同的機器,機器Mi的速度為α1,假設α1α2…αm且α1=1.P為所有工件的加工時間之和,每臺機器的激活費用B均為1.模型一的社會成本(?)為所有工件的個體成本Cj之和,目標為極小化社會成本.通過對模型POA的分析,我們得到了POA的上界(?)；模型二的社會成本Cmax為工件的最大個體成本,目標為極小化社會成本.通過對模型POA的分析,我們得到了POA的上界(?).第四章主要研究帶不同激活費用的m臺恒速機上工件的博弈排序問題的模型Qm(·),B=αi|ut=-Cj|Cmax.模型中,有m臺速度不同的機器,機器Mi的速度為αi,激活費用B也為αi,假設α1α2…αm且α1=1.社會成本Cmax為工件的最大個體成本,目標為極小化社會成本.通過對模型POA的分析,我們得到了POA的上界(?).
[Abstract]:In this paper, we mainly study the game ordering problem of the workpiece with activation cost under the condition of limited resources. The initial state of the machine is not activated, each machine will be activated at a certain cost. There are no central weights to control the sort, each job is the equivalent of a player, and they minimise individual costs to select machines for processing. The individual cost of each of the workpieces is the sum of the completion time of the machine it chooses and the portion of the activation cost it has to bear. The difference between the social cost and the optimal value of the worst Nash equilibrium is measured by using the disordered cost (POA). In this paper, the different objective functions of the game ordering problem of two constant speed machines with activation cost and m constant speed machines are studied. The first chapter mainly introduces the sequencing problem, the game theory and the research background of the game scheduling problem, related theoretical knowledge and research status, and briefly explains the main research results and innovation points of this paper. In chapter 2, the model of game ordering problem for two machines with activation cost is studied. In the model, the speed of the two machines is 1 and 偽, respectively, and the activation cost B of the machine is the same as its speed. Social costs) The goal is to minimize the social cost for the sum of individual costs of all artifacts. By analyzing the model POA, we obtain the upper bound 偽 1 of POA and give an example of POA lower bound 偽 -1. In chapter 3, we mainly study two models of the game ordering problem of the workpiece of m machine with the same activation cost. In the model, there are m machines with different speeds. The speed of machine Mi is 偽 1. Assume that 偽 1 偽 2 鈥，

本文編號：1990243