Makespan minimisation with sequence-dependent machine deterioration and maintenance events
研究了并行机调度中机器需定期维护、加工时间受前序任务影响的问题，提出了占优准则并设计了构造式启发算法，通过计算实验分析了问题难度和算法敏感性。
This paper addresses the minimal makespan parallel machine problem where machines are subject to preventive maintenance events of a known deterministic duration. The processing time of a job depends on its predecessors since the machine’s last maintenance. The paper proposes some dominance criteria for sequences of jobs assigned to a machine, and uses these criteria to design constructive heuristics to this NP-hard problem. The computational investigation determines the parameters that make a hard instance and studies the sensitivity of the heuristics to these parameters.