...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Production Research >Single-machine scheduling problems with a batch-dependent aging effect and variable maintenance activities
【24h】

Single-machine scheduling problems with a batch-dependent aging effect and variable maintenance activities

机译：单机调度问题，具有批次依赖的老化效果和可变的维护活动

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

摘要

We consider single-machine scheduling problems with a batch-dependent ageing effect and variable maintenance activities between batches. The machine can process several jobs as a batch. It requires maintenance activities where the maintenance time depends on the flow time of the pre-batch, i.e. the batch processed before a batch. A job's actual processing time is an increasing exponential function of its operation time within a batch. The objectives are to minimise the makespan and the total completion time. We develop polynomial time algorithms for the makespan minimisation problem and the total completion time minimisation problem under the condition that the ageing factor is greater than one. We also provide a mathematical programming approach and two heuristic algorithms to analyse the total completion time minimisation problem when the ageing factor is less than one for even one batch. The computational analysis indicates that the proposed heuristic algorithms are more efficient for the smaller ageing factor, whereas the Modified Shortest Processing Time algorithm is more efficient than the proposed heuristic algorithms for the larger ageing factor.
机译：我们考虑单机调度问题，该问题具有与批次相关的老化效果以及批次之间的可变维护活动。机器可以批量处理多个作业。它需要维护活动，其中维护时间取决于预批生产的时间，即批次之前处理的批次。作业的实际处理时间是批次中作业时间的递增指数函数。目的是最小化制造时间和总完成时间。我们针对老化因子大于1的最小化制造时间和总完成时间最小化问题，开发了多项式时间算法。我们还提供了一种数学编程方法和两种启发式算法，以分析即使对于一批而言老化因子小于1的总完成时间最小化问题。计算分析表明，所提出的启发式算法对较小的老化因子更有效，而修正最短处理时间算法比所提出的启发式算法对较大的老化因子更有效。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号