...
首页> 外文期刊>Research Papers Faculty of Materials Science and Technology Slovak University of Technology >Integrative Programming of Production and Preventive Maintenance Tasks in an Environment of Identical Parallel Machines: Proposal of a Construction Heuristic
【24h】

Integrative Programming of Production and Preventive Maintenance Tasks in an Environment of Identical Parallel Machines: Proposal of a Construction Heuristic

机译:相同并行机环境中生产和预防性维护任务的集成编程:构造启发式建议

获取原文
           

摘要

The article presents a constructive heuristic for the integrated programming of production orders and preventive maintenance (PM) interventions in an environment of identical parallel machines, aimed at minimizing the completion time of the last scheduled job (makespan). Unlike other proposals found in the literature, the one here considers that the time between preventive interventions is not previously known, but instead, this is assumed as one of the decision variables of the system in the beginning of each of these interventions; in addition, the proposal also considers the possibility that not all jobs have the same release time. The design of the heuristic algorithm is based on the general approach of the Longest Processing Time dispatch rule, with a slight modification in its conception to consider the random character of the equipment failures and their impact on the execution time of the tasks. Consequently, a simple dispatch rule called rj - LPT was also proposed to comply with one of the steps of the heuristic, as well as an algorithm to determine the minimum dimension for the makespan, which constitutes the basis of the stop criterion linked to the initial solution.
机译:本文介绍了一种建设性的启发式方法,用于在相同并行机的环境中对生产订单和预防性维护(PM)干预进行集成编程,旨在最大程度地减少上次计划工作的完成时间(制造跨度)。与文献中发现的其他建议不同,这里的建议认为预防性干预之间的时间是先前未知的,但是,这被假定为每种干预开始时系统的决策变量之一。此外,该提案还考虑了并非所有工作都具有相同的发布时间的可能性。启发式算法的设计基于“最长处理时间”调度规则的一般方法,并对其概念进行了少许修改,以考虑设备故障的随机性及其对任务执行时间的影响。因此,还提出了一种简单的调度规则,称为rj-LPT,以符合启发式算法的步骤之一,以及一种算法,该算法可以确定最小设计尺寸,该模型构成了与初始链接相关的停止标准的基础。解。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号