本文選題：儲(chǔ)存時(shí)間 + 供應(yīng)鏈排序　； 參考：《運(yùn)籌學(xué)學(xué)報(bào)》2017年02期

【摘要】：研究一類儲(chǔ)存時(shí)間有上限的兩階段供應(yīng)鏈排序問題.兩階段是指工件先加工,后運(yùn)輸:加工階段是一臺(tái)加工機(jī)器逐個(gè)加工工件;運(yùn)輸階段是無限臺(tái)車輛分批運(yùn)輸完工的工件.工件的運(yùn)輸完成時(shí)刻與完工時(shí)刻之差定義為工件的儲(chǔ)存時(shí)間,且有相應(yīng)的儲(chǔ)存費(fèi)用,且任意工件的儲(chǔ)存時(shí)間都不超過某一常數(shù).若工件的運(yùn)輸完成時(shí)刻早于(晚于)交貨期窗口的開始(結(jié)束)時(shí)刻,則有相應(yīng)的提前(延誤)懲罰費(fèi)用.目標(biāo)是極小化總提前懲罰費(fèi)用、總延誤懲罰費(fèi)用、總儲(chǔ)存費(fèi)用、總運(yùn)輸費(fèi)用以及與交貨期窗口有關(guān)的費(fèi)用之和.先證明該問題是NP-難的,后對(duì)單位時(shí)間的儲(chǔ)存費(fèi)用不超過單位時(shí)間的延誤懲罰費(fèi)用的情形給出了偽多項(xiàng)式時(shí)間算法.
[Abstract]:This paper deals with a two-stage supply chain scheduling problem with upper storage time. The two-stage process means that the workpiece is processed first and then transported: the processing stage is the workpiece processed one by a machining machine; the transportation stage is the workpiece completed by the batch transportation of infinite vehicles. The difference between the completion time and the completion time of the work piece is defined as the storage time of the workpiece with the corresponding storage cost and the storage time of any workpiece does not exceed a constant. If the delivery of the work is completed earlier than the start (end) of the delivery window, there will be a penalty charge for the advance (delay). The goal is to minimize the total early penalty cost, total delay penalty cost, total storage cost, total shipping cost, and the sum of the costs associated with the delivery window. It is proved that the problem is NP-hard first, and then the pseudo-polynomial time algorithm is given for the case that the storage cost per unit time does not exceed the penalty cost of delay per unit time.
【作者單位】： 曲阜師范大學(xué)管理學(xué)院運(yùn)籌學(xué)研究所;
【基金】：國家自然科學(xué)基金(No.61340045) 山東省自然科學(xué)基金重點(diǎn)項(xiàng)目(No.ZR2015GZ009)
【分類號(hào)】：O223
，

本文編號(hào)：2053852