...
首页> 外文期刊>Journal of Quality in Maintenance Engineering >Multiple-route job shop scheduling with fixed periodic and age-dependent preventive maintenance to minimize makespan
【24h】

Multiple-route job shop scheduling with fixed periodic and age-dependent preventive maintenance to minimize makespan

机译:多路线作业车间调度,具有固定的定期维护和与年龄相关的预防性维护,以最大程度地缩短工期

获取原文
获取原文并翻译 | 示例
           

摘要

Purpose - In many manufacturing systems, machines are subject to preventive maintenance. This paper aims to schedule the operations of jobs and preventive maintenance tasks in such a way that the completion time of jobs and preventive maintenance tasks is minimized.Design/methodology/approach - An heuristic approach based on artificial immune algorithm is proposed for solving the multiple-route job shop-scheduling problem subject to fixed periodic and age-dependent preventive maintenance tasks. Under fixed periodic assumption, the time between two consecutive preventive maintenance tasks is assumed constant. Under age-dependent assumption, a preventive maintenance task is triggered if the machine operates for a certain amount of time. The goal is to schedule the jobs and preventive maintenance task subject to makespan minimization. Findings - In addition to presenting mathematical formulation for the multiple-route job shop-scheduling problem, this paper proposes a novel approach by which one can tackle the complexity that is raised in scheduling and sequencing the jobs and the preventive maintenance simultaneously and obtain the required schedule in reasonable time.Practical implications - Integrating preventive maintenance tasks into the scheduling procedure is vital in many manufacturing systems. Using the proposed approach, one can obtain a schedule that defines the production route through which each part is processed, the time each operation must be started, and when preventive maintenance must be carried out on each machine. This, in turn, results in overall manufacturing cost reduction.Originality/value - Using the approach proposed in this paper, good solutions, if not optimal, can be obtained for scheduling jobs and preventive maintenance task in one of the most complicated job shop configurations, namely, multiple-route job shop. Thus, the approach can dominate all other simpler configurations.
机译:目的-在许多制造系统中,机器都必须进行预防性维护。本文旨在以最小化作业和预防性维护任务完成时间的方式安排作业和预防性维护任务的调度。设计/方法/方法-提出了一种基于人工免疫算法的启发式方法来解决多重任务定期安排车间和车间的问题,要遵循固定的定期和与年龄相关的预防性维护任务。在固定的周期假设下,两个连续的预防性维护任务之间的时间假定为恒定。在与年龄有关的假设下,如果机器运行一定时间,则会触发预防性维护任务。目标是安排作业和预防性维护任务,以使制造周期最小化。发现-除了为多路线作业车间调度问题提供数学公式外,本文还提出了一种新颖的方法,通过该方法,可以解决在调度和排序作业以及预防性维护的同时增加的复杂性并获得所需的实际意义-在许多制造系统中,将预防性维护任务集成到计划程序中至关重要。使用所提出的方法,可以获得时间表,该时间表定义了加工每个零件的生产路线,必须开始每个操作的时间以及何时必须对每台机器进行预防性维护。相应地,这将导致整体制造成本的降低。原始性/价值-使用本文提出的方法,可以得到最佳的解决方案,如果不是最佳的话,则可以在最复杂的车间配置之一中安排作业和预防性维护任务,即多路线工作间。因此,该方法可以支配所有其他更简单的配置。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号