...
首页> 外文期刊>European Journal of Operational Research >A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
【24h】

A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows

机译:一种基于网络流的方法来解决性能成本和带有时间窗的makepan开放车间调度问题

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

摘要

This paper deals with several bicriteria open-shop scheduling problems where jobs are pre-emptable and their corresponding time-windows must be strictly respected. The criteria are a performance cost and the makespan. Network flow approaches are used in a lexmin procedure with a bounded makespan and the considered bicriteria problems are solved. Finally, the computational complexity of the algorithm and a numerical example are reported. (C) 2008 Elsevier B.V. All rights reserved.
机译:本文讨论了几个双重标准的开店调度问题,在这些问题中,工作是可抢占的,必须严格遵守其相应的时间窗口。标准是性能成本和工期。在lexmin过程中使用网络流方法,并限制了生成时间,并解决了所考虑的双标准问题。最后,报告了算法的计算复杂度和数值例子。 (C)2008 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号