We consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of completion times. They are handled through a lexicographic approach, due to a natural hierarchy among the two objectives in the applications considered. The main contributions of this paper are first to present a new problem relevant to practice, second, to develop a mixed-integer-linear-program model for the problem, and third, to introduce two generalizable tabu-search metaheuristics relying on different neighborhood structures and solution spaces. Computational results for 120 instances (generated from a real case) are reported to empirically demonstrate the effectiveness of the proposed metaheuristics.

我们在这项工作中考虑了两个不同并行机器上的双准则调度问题，并具有定期预防性维护策略。考虑的两个目标包括最小化拒绝工作的成本和完成时间的加权总和。由于所考虑的应用程序中两个目标之间的自然层次结构，它们是通过字典法处理的。本文的主要贡献是首先提出了一个与实践相关的新问题，其次，为该问题开发了一个混合整数线性规划模型，以及第三，介绍了两个依赖于不同邻域结构的可推广禁忌搜索元启发式算法。和解决方案空间。报告了 120 个实例（从真实案例生成）的计算结果，以经验证明所提出的元启发式方法的有效性。