考虑设备周期性维护的单机调度问题研究
首发时间:2017-03-27
摘要:针对单机调度问题,在考虑周期预防性维护的基础上,以最小化最大拖期为优化目标,建立了整数规划模型来决策工件的最优加工顺序。针对模型的特点,本文提出了一种两阶段启发式算法(Two Stage Heuristic Algorithm, TSHA ),依据批次的最优排序规则,获得一个初始调度序列,再通过对批次松弛时间的充分利用,在不增大最大拖期的前提下,使最大拖期工件前移或者使最大拖期工件的开工时间提前,进而获得更优的调度安排。通过计算实验,与CPLEX最优解以及已有启发式算法的解作对比,结果表明,本文所提出的启发式算法性能更加优异,能有效解决工件不可中断情况下的以周期性维护为资源约束的单机调度问题。
关键词: 单机调度 周期性维护 最大拖期 松弛时间 启发式算法
For information in English, please click here
Single-machine scheduling with periodic maintenance
Abstract:This paper considers a single-machine problem with periodic maintenance which the objective is to minimize the maximum tardiness. A integer programming model is developed to find a optimal schedule. We propose a two stage heuristic algorithm in which an initial solution is obtained first with the batch ordering rule and then the solution is improved by left-shifting the most tardy job or advancing it's starting time. Through computational experiments, the performance of the proposed heuristic is evaluated by comparing the solution with those obtained from CPLEX and an existing heuristic algorithm, and the result shows that the presented heuristic can solve the single-machine scheduling problem subject to periodic maintenance and nonresumable jobs effectively.
Keywords: single-machine periodic maintenance maximum tardiness slack time heuristic algorithm
基金:
论文图表:
引用
No.4722235118823014****
同行评议
共计0人参与
勘误表
考虑设备周期性维护的单机调度问题研究
评论
全部评论0/1000