论文标题
最大程度地减少涉及流动时间和拖延罚款的维护成本，并释放不平等的日期
Minimizing Maintenance Cost Involving Flow-time and Tardiness Penalty with Unequal Release Dates
论文作者
论文摘要
本文提出了有关最小化流动时间之和的最小化以及具有不平等释放日期（出现日期）的任务或工作的迟到的重要和有用的结果，并应用于维护计划和计划。首先，定义了实时维护政策，以最大程度地减少迟到和关键状态的成本。证明了所需的本地最优规则（FTR），以最大程度地减少任务流动时间和拖延成本的总和或线性组合。该规则已用于设计调度算法，当将其应用于一个处理器上的一组N任务时，具有O（n 3）的复杂性。为了评估其性能，将结果与在数值案例研究中提供的下限进行了比较。使用该算法与任务紧急标准结合使用，开发了一种实时算法来安排Q并行处理器上的任务。在分布式系统的情况下，后一种算法最终应用于计划并将预防性维护任务分配给处理器。如数值示例所示，其效率可以最大程度地减少预防性维护任务的成本，以降低预防性维护任务的成本，表示为任务和流动时间的总和。这对应于关键国家的成本和预防性维护的迟到。
This paper proposes important and useful results relating to the minimization of the sum of the flow-time and the tardiness of tasks or jobs with unequal release dates (occurrence date), with application to maintenance planning and scheduling. Firstly, the policy of real-time maintenance is defined for minimizing the cost of tardiness and critical states. The required local optimality rule (FTR) is proved, in order to minimize the sum or the linear combination of the tasks' flow-time and tardiness costs. This rule has served to design a scheduling algorithm, with O(n 3) complexity when it is applied to schedule a set of n tasks on one processor. To evaluate its performance, the results are compared to a lower bound that is provided, in a numerical case study. Using this algorithm in combination with the tasks urgency criterion, a real-time algorithm is developed to schedule the tasks on q parallel processors. This latter algorithm is finally applied to schedule and assign preventive maintenance tasks to processors in the case of a distributed system. Its efficiency enables, as shown in the numerical example, to minimize the cost of preventive maintenance tasks, expressed as the sum of the tasks tardiness and flow-time. This corresponds to costs of critical states and of tardiness of preventive maintenance.
