储存时间有上限的两阶段供应链排序问题

发布时间：2018-06-22 18:50

  本文选题：储存时间 + 供应链排序　； 参考：《运筹学学报》2017年02期

【摘要】：研究一类储存时间有上限的两阶段供应链排序问题.两阶段是指工件先加工,后运输:加工阶段是一台加工机器逐个加工工件;运输阶段是无限台车辆分批运输完工的工件.工件的运输完成时刻与完工时刻之差定义为工件的储存时间,且有相应的储存费用,且任意工件的储存时间都不超过某一常数.若工件的运输完成时刻早于(晚于)交货期窗口的开始(结束)时刻,则有相应的提前(延误)惩罚费用.目标是极小化总提前惩罚费用、总延误惩罚费用、总储存费用、总运输费用以及与交货期窗口有关的费用之和.先证明该问题是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