• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Institute of Industrial and Systems Engineers Annual Conference and Expo >Simulated Annealing Approach for Minimizing Makespan of a Batch Processing Machine with Unequal Job Ready Times: Abstract ID: 793760
【24h】

Simulated Annealing Approach for Minimizing Makespan of a Batch Processing Machine with Unequal Job Ready Times: Abstract ID: 793760

机译：用不等作业准备好时代最大限度地减少批量加工机的MAPESPHAN的模拟退火方法：摘要ID：793760

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Batch Processing Machines (BPMs) are commonly used in semi-conductor manufacturing, metal working, and contract electronics manufacturing - to name a few. This research aims at developing an effective and efficient solution approach for scheduling jobs on a single BPM. Given a set of jobs with their processing times, ready times, and sizes, batches are formed and scheduled on a BPM to minimize makespan. The machine can process a batch as long as the total size of all the jobs assigned to the batch do not exceed the machine capacity. The processing time of the batch is equal to the longest processing time of all the jobs assigned to a batch. The ready time of the batch is equal to the latest ready time of all the jobs assigned to a batch. As the problem is NP-hard, a Simulated Annealing (SA) approach is developed and its solution is compared to a commercial solver used to solve a mathematical formulation. An experimental study highlights the effectiveness of the SA approach in solving larger problem instances.
机译：批量加工机（BPMS）通常用于半导体制造，金属工作和合同电子产品制造 - 仅举几例。本研究旨在开发有效高效的解决方案方法，用于在单个BPM上调度作业。给定一组具有其处理时间的作业，准备时间和大小，在BPM上形成并计划批量，以最小化MEPESPAN。机器可以处理批次，只要分配给批次的所有作业的总大小都不超过机器容量。批处理的处理时间等于分配给批处理的所有作业的最长处理时间。批处理的准备时间等于分配给批处理的所有作业的最新现成时间。由于问题是NP - 硬，开发了模拟退火（SA）方法，并将其解决方案与用于解决数学制剂的商业求解器进行比较。实验研究突出了SA方法在解决较大问题实例中的有效性。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号