带有维修活动和交货期窗口的单机排序问题

发布时间：2018-06-09 16:48

本文选题：排序 + 单机　；参考：《重庆师范大学学报(自然科学版)》2017年03期

【摘要】：【目的】带有维修活动和交货期窗口的单机排序问题在现实生活中有着广泛的应用。每个工件都有属于自己的交货期窗口,工件在交货期窗口外完工,就会产生相应的提前、延误惩罚。因此,确定交货期窗口位置具有重要意义。【方法】考虑了2种维修活动:依赖于时间、资源的维修活动;依赖于位置、资源的维修活动。针对不同的维修位置,将问题转化为指派问题。【结果】给出了计算复杂性是O(n4)的多项式时间算法。【结论】证明了该问题是多项式时间可解的。
[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.
【作者单位】：沈阳师范大学数学与系统科学学院;
【基金】：辽宁省教育厅科学研究基金(No.L2014433)
【分类号】：O223

【相似文献】