本文選題：排序 + 單機(jī)　； 參考：《重慶師范大學(xué)學(xué)報(bào)(自然科學(xué)版)》2017年03期

【摘要】：【目的】帶有維修活動(dòng)和交貨期窗口的單機(jī)排序問(wèn)題在現(xiàn)實(shí)生活中有著廣泛的應(yīng)用。每個(gè)工件都有屬于自己的交貨期窗口,工件在交貨期窗口外完工,就會(huì)產(chǎn)生相應(yīng)的提前、延誤懲罰。因此,確定交貨期窗口位置具有重要意義。【方法】考慮了2種維修活動(dòng):依賴于時(shí)間、資源的維修活動(dòng);依賴于位置、資源的維修活動(dòng)。針對(duì)不同的維修位置,將問(wèn)題轉(zhuǎn)化為指派問(wèn)題�！窘Y(jié)果】給出了計(jì)算復(fù)雜性是O(n4)的多項(xiàng)式時(shí)間算法�！窘Y(jié)論】證明了該問(wèn)題是多項(xiàng)式時(shí)間可解的。
[Abstract]:Objective: single machine scheduling problem with maintenance activity and delivery window is widely used in real life. Each workpiece has its own delivery window. When the workpiece is completed outside the due window, it will lead to the penalty of delay and advance. Therefore, it is important to determine the location of due window. [methods] two kinds of maintenance activities are considered: maintenance activities dependent on time and resources, maintenance activities dependent on location and resources. For different maintenance positions, the problem is transformed into an assignment problem. [results] A polynomial time algorithm for computing complexity is given. [conclusion] it is proved that the problem is polynomial time solvable.
【作者單位】： 沈陽(yáng)師范大學(xué)數(shù)學(xué)與系統(tǒng)科學(xué)學(xué)院;
【基金】：遼寧省教育廳科學(xué)研究基金(No.L2014433)
【分類號(hào)】：O223

【相似文獻(xiàn)】

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

1 陳東;趙傳立;;帶有維修活動(dòng)和工件可拒絕的單機(jī)排序問(wèn)題[J];沈陽(yáng)師范大學(xué)學(xué)報(bào)(自然科學(xué)版);2014年02期

，

本文編號(hào)：2000430