在退化维修活动下具有多窗口及退化效应的单机排序问题

发布时间：2018-04-27 08:37

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

【摘要】：【目的】对多窗口和具有退化效应与退化维护活动的单机排序问题进行求解。【方法】假设任务的实际加工时间是关于该任务加工位置的函数,一个窗口不能包含另一个窗口。由于机器存在退化效应,适时地对机器进行维护能提高机器的生产效率。一旦维护活动结束,机器恢复到最初状态,并且任务的退化效应更新,机器维护活动持续的时间取决于维护活动的开始时间。将所有任务分成若干个任务集,任务集个数已知,每一个任务集共用一个窗口。目标是得到每个任务集最优窗口的位置、大小和最优维护活动的位置及任务的最优加工顺序使得任务的提前惩罚费用、延误惩罚费用、窗口开始时间及宽度费用之和最小。【结果】证明了此问题可以通过转化为指派问题求得最优解。【结论】并给出一个多项式时间算法来解该问题。
[Abstract]:[aim] to solve the multi-window and single-machine scheduling problem with degenerate effect and degenerate maintenance activities. [method] it is assumed that the actual processing time of a task is a function of the processing position of the task, and one window cannot contain another window. Due to the degradation of the machine, timely maintenance of the machine can improve the production efficiency of the machine. Once the maintenance activity is finished, the machine returns to its original state, and the degradation effect of the task is updated. The duration of the machine maintenance activity depends on the start time of the maintenance activity. All tasks are divided into several task sets, the number of task sets is known, and each task set shares a window. The goal is to get the location of the optimal window for each task set, the size, the location of the optimal maintenance activity and the optimal processing order of the task so that the cost of the task is punished in advance and the penalty cost is delayed. It is proved that this problem can be transformed into an assignment problem to obtain the optimal solution. [conclusion] and a polynomial time algorithm is given to solve the problem.
【作者单位】：沈阳师范大学数学与系统科学学院;
【基金】：国家自然科学基金(No.11171050) 辽宁省教育厅项目(No.L2014433)
【分类号】：O223

【相似文献】