• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Quality Control and Applied Statistics >Minimizing completion time with maintenance schedule in a manufacturing system
【24h】

Minimizing completion time with maintenance schedule in a manufacturing system

机译：通过制造系统中的维护计划最大程度地减少完成时间

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Purpose - In practical environments, machines subject to maintenance are prevalent in many production systems. This paper aims to find a schedule that minimizes the completion time (or equivalently, the total setup time) subject to maintenance and due dates. Design/methodology/approach - An efficient heuristic is presented to provide the near-optimal solution for the problem. The performance of the heuristic is evaluated by comparing its solution with the optimal solution obtained from the integer linear programming model.Findings _ In many production systems, the sequence-dependent setup time of a job cannot be ignored when a switch between two different jobs occurs. The paper studies the sequence-dependent setup time problem with periodic maintenance, where several maintenances are required. Computational results show that problems with larger time interval and smaller maintaining time can produce a smaller completion time.Practical implications - Here an efficient heuristic is developed to provide the near-optimal schedule for the problem. The proposed integer linear programming model is also presented to provide the optimal schedule. However, the proposed heuristic and the integer linear programming model developed in the paper are appropriate for those companies where maintenance is performed periodically and the sequence-dependent setup times of their jobs are required.Originality/value - The paper presents the heuristic and the integer linear programming model to deal with sequencing and maintenance problems.
机译：目的-在实际环境中，需要维护的机器在许多生产系统中都很普遍。本文旨在寻找一个时间表，以最大程度地减少完成时间（或等效地，总设置时间），该时间取决于维护和到期日。设计/方法/方法-提出了一种有效的启发式方法来为问题提供近乎最佳的解决方案。通过将启发式算法的解决方案与从整数线性规划模型获得的最优解决方案进行比较，来评估启发式算法的性能。发现_在许多生产系统中，当两个不同作业之间进行切换时，作业的顺序相关设置时间不能忽略。本文研究需要定期维护的序列维护时间问题。计算结果表明，具有较大时间间隔和较小维护时间的问题可以产生更短的完成时间。实际意义-在此，开发了一种有效的启发式方法来为问题提供接近最佳的时间表。还提出了所提出的整数线性规划模型以提供最佳调度。但是，本文中提出的启发式和整数线性规划模型适用于那些需要定期进行维护并且需要根据工作顺序进行设置的公司。原始数据/价值-本文介绍了启发式和整数线性规划模型来处理排序和维护问题。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号