本文選題：儲存時間 + 供應鏈排序��； 參考：《運籌學學報》2017年02期

【摘要】：研究一類儲存時間有上限的兩階段供應鏈排序問題.兩階段是指工件先加工,后運輸:加工階段是一臺加工機器逐個加工工件;運輸階段是無限臺車輛分批運輸完工的工件.工件的運輸完成時刻與完工時刻之差定義為工件的儲存時間,且有相應的儲存費用,且任意工件的儲存時間都不超過某一常數(shù).若工件的運輸完成時刻早于(晚于)交貨期窗口的開始(結(jié)束)時刻,則有相應的提前(延誤)懲罰費用.目標是極小化總提前懲罰費用、總延誤懲罰費用、總儲存費用、總運輸費用以及與交貨期窗口有關的費用之和.先證明該問題是NP-難的,后對單位時間的儲存費用不超過單位時間的延誤懲罰費用的情形給出了偽多項式時間算法.
[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.
【作者單位】： 曲阜師范大學管理學院運籌學研究所;
【基金】：國家自然科學基金(No.61340045) 山東省自然科學基金重點項目(No.ZR2015GZ009)
【分類號】：O223
，

本文編號：2053852