首页> 外文期刊>Computers & operations research >Minimizing total weighted tardiness on a single batch process machine with incompatible job families
【24h】

Minimizing total weighted tardiness on a single batch process machine with incompatible job families

机译:具有不兼容的作业族的单批处理机器上的总加权拖尾率降至最低

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

摘要

The diffusion step in semiconductor wafer fabrication is very time consuming, compared to other steps in the process, and performance in this area has a significant impact on overall factory performance. Diffusion furnaces are able to process multiple lots of similar wafers at a time, and are therefore appropriately modeled as batch processing machines with incompatible job families. Due to the importance of on-time delivery in semiconductor manufacturing, we focus on minimizing the total weighted tardiness in this environment. The resulting problem is NT-Hard, and we decompose it into two sequential decision problems: assigning lots to batches followed by sequencing the batches. We develop several heuristics for these subproblems and test their performance.
机译:与该工艺中的其他步骤相比,半导体晶圆制造中的扩散步骤非常耗时,并且该区域的性能对整体工厂性能有重大影响。扩散炉能够一次处理多个类似的晶片,因此可以适当地建模为具有不兼容工作族的批处理机。由于准时交货在半导体制造中的重要性,因此我们致力于在这种环境下最大程度地减少总拖延时间。由此产生的问题是NT-Hard,我们将其分解为两个顺序决策问题:将批次分配给批次,然后对批次进行排序。我们针对这些子问题开发了几种启发式方法,并测试了它们的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号