Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events
研究了在非相关并行机器上，考虑作业加工时间随机器自上次维护后处理作业集而恶化的调度问题，提出了四种混合整数线性规划模型和一种迭代局部搜索元启发式算法，并通过大量实验验证了性能。
In this work, we study the problem of scheduling jobs and maintenance activities on a set of unrelated parallel machines, by considering that the processing time of a job increases according to a deterioration factor that depends both on the machine and on the set of jobs the machine has processed since its last maintenance. The objective we consider is to minimize the makespan. We introduce four mixed integer linear programming models, two of which using big-M constraints and the other two using an exponential number of variables. We also propose an iterated local search metaheuristic to tackle large size instances and we provide empirical evidence of the performance of the proposed approaches by means of extensive computational experiments.