首页> 外文会议>33rd Annual meeting of the Decision Sciences Institute >Due Date Assignment and Sequencing in Single Machine Shop with Uncertain Process Times: A Laplace Approach
【24h】

Due Date Assignment and Sequencing in Single Machine Shop with Uncertain Process Times: A Laplace Approach

机译:具有不确定过程时间的单机车间中的到期日分配和排序:一种拉普拉斯方法

获取原文

摘要

This paper considers due date assignment and sequencing for multiple jobs in a single machine shop. The processing time of each job is assumed to be uncertain, which is characterized by mean and standard deviation. The objective is to minimize the total penalty involved in the due date assignment and sequencing, which includes penalties on job earliness and tardiness and penalty associated with long due date quote. We introduce a heuristic to solve the problem. Our procedure depends on not only the mean processing time but also the variance of the processing time. The numerical tests indicate the procedure perform better than the one based on the mean processing time only.
机译:本文考虑了在单个机器车间中多个作业的截止日期分配和排序。假设每个作业的处理时间是不确定的,其特征在于平均值和标准偏差。目的是最大程度地减少在到期日分配和排序中涉及的总罚款,其中包括对工作早期和拖延的处罚以及与较长到期日报价相关的罚款。我们介绍一种启发式方法来解决该问题。我们的程序不仅取决于平均处理时间,还取决于处理时间的变化。数值测试表明,仅基于平均处理时间,该过程的效果要优于该过程。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号