...
首页> 外文期刊>Operations Research Letters: A Journal of the Operations Research Society of America >On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times
【24h】

On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times

机译:在单机串行批处理调度问题上,以使具有优先约束,发布日期和相同处理时间的总完成时间最小化

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

摘要

We consider the single machine, serial batching, total completion time scheduling problem with precedence constraints, release dates and identical processing times in this paper. The complexity of this problem is reported as, open in the literature. We provide an 0(n(5)) time algorithm to solve this problem. (C) 2003 Elsevier Science B.V. All rights reserved. [References: 7]
机译:在本文中,我们考虑了单机,连续批处理,具有优先约束的总完成时间计划问题,发布日期和相同的处理时间。据报道,该问题的复杂性在文献中公开。我们提供了一个0(n(5))时间算法来解决此问题。 (C)2003 Elsevier Science B.V.保留所有权利。 [参考:7]

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号