首页> 外文期刊>International Journal of Production Research >Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times
【24h】

Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times

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

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

摘要

Semiconductor wafer fabrication facilities ("wafer fabs") strive to maximize on-time delivery performance for customer orders. Effectively scheduling jobs on critical or bottleneck equipment in the wafer fab can promote on-time deliveries. One type of critical fab equipment is a diffusion oven which processes multiple wafer lots (jobs) simultaneously in batches. We present a new polynomial time Batch Improvement Algorithm for scheduling a batch-processing machine to maximize on-time delivery performance (minimize total weighted tardiness) when job arrivals are dynamic. The proposed algorithm's performance is compared to previous research efforts under varying problem conditions. Experimental studies demonstrate the effectiveness of the Batch Improvement Algorithm.
机译:半导体晶圆制造厂(“晶圆厂”)努力使客户订单的准时交货性能最大化。有效地安排晶圆厂关键或瓶颈设备上的作业可以促进准时交货。一种重要的晶圆厂设备是扩散炉,该扩散炉可同时批量处理多个晶圆(作业)。我们提出了一种新的多项式时间批处理改进算法,用于调度批处理机器,以在工作动态到达时最大程度地提高准时交付性能(最小化总加权拖延时间)。将所提出算法的性能与以前在各种问题条件下的研究成果进行比较。实验研究证明了批次改进算法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号