...
首页> 外文期刊>Discrete Applied Mathematics >Preemptive scheduling and antichain polyhedra
【24h】

Preemptive scheduling and antichain polyhedra

机译:抢占式调度和反链多面体

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

摘要

We present a theoretical framework, which is based upon notions of ordered hypergraphs and antichain polyhedra, and which is dedicated to the combinatorial analysis of preemptive scheduling problems submitted to parallelization constraints. This framework allows us to characterize specific partially ordered structures which are such that induced preemptive scheduling problems may be solved through linear programming. To prove that, in the general case, optimal preemptive schedules may be searched inside some connected subset of the vertex set of an Antichain Polyhedron. (C) 2008 Published by Elsevier B.V.
机译:我们提出了一个基于有序超图和反链多面体概念的理论框架,该框架致力于对并行化约束下的先发式调度问题进行组合分析。该框架使我们能够表征特定的部分有序结构,这样可以通过线性编程解决先发制人的调度问题。为了证明在一般情况下,可以在反链多面体的顶点集的某些连接子集中搜索最佳抢先时间表。 (C)2008由Elsevier B.V.发布

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号