• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>International Journal of Computer Integrated Manufacturing >A generalisation model of learning and deteriorating effects on a single-machine scheduling with past-sequence-dependent setup times
【24h】

A generalisation model of learning and deteriorating effects on a single-machine scheduling with past-sequence-dependent setup times

机译：具有与过去序列有关的建立时间的单机调度中学习和恶化影响的通用模型

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

摘要

This article introduces a general single-machine setup times scheduling model with learning effect and deteriorating jobs simultaneously which is a generalisation of some existing models in the literature. The setup times are proportional to the length of the already processed jobs, i.e. the setup times are past-sequence-dependent (p-s-d). By the effects of learning and deterioration, we mean that the actual processing time of a job depends not only on the starting time of the job but also on its scheduled position. The article shows that the problems to minimise the makespan, sum of the kth power of completion times, total lateness and sum of earliness penalties (with common due date) are polynomially solvable under the proposed model. It further shows that the problems to minimise total weighted completion time, maximum lateness, maximum tardiness, total tardiness and total weighted earliness penalties (with common due date) are polynomially solvable under certain conditions.
机译：本文介绍了一种具有学习效果和工作恶化同时的单机设置时间调度模型，该模型是文献中一些现有模型的概括。设置时间与已处理作业的长度成正比，即设置时间取决于过去的顺序（p-s-d）。通过学习和恶化的影响，我们意味着作业的实际处理时间不仅取决于作业的开始时间，还取决于其预定位置。该文章表明，在所提出的模型下，可以最小化制造期，完成时间的k次方，总迟到时间和提前罚款总和（具有共同到期日）的问题可以通过多项式解决。它进一步表明，在某些条件下，可以使总加权完成时间，最大延迟，最大拖延时间，总拖延时间和总加权早期惩罚（具有共同到期日）最小化的问题是多项式可解决的。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号