位置：成果数据库 > 期刊 > 期刊详情页
A semi-on-line scheduling problem of two parallel machines with common maintenance time
  • ISSN号：0217-5959
  • 期刊名称：Asia Pacific Journal of Operational Research
  • 时间：2012.8.8
  • 页码：1-13
  • 相关项目：网络可靠性参数的优化研究
作者： Cai, Yuhua|Feng, Qi|Li, Wenjie|
同期刊论文项目
网络可靠性参数的优化研究
期刊论文 60 会议论文 2
同项目期刊论文
Fault-free Hamiltonian cycles passing through a linear forest in ternary -cubes with faulty edges
Many-to-many disjoint path covers in -ary -cubes
k元n方体的边容错性
完全偶图的定向图
k元n立方网络的k圈排除问题的递归算法
成本倒推装卸工问题
λ5-最优图的一个充分条件
带有条件故障边的k元2方体的圈嵌入
图是λ5-最优的邻域交条件
图与补图孤立断裂度的关系
Ménage问题的一种粘贴DNA算法
孤立断裂度给定条件下的一类图
泡型图的条件匹配排除
带有条件故障边的3元n方体的圈嵌入
图是λ5-最优的充分条件
一个具有退化的两个代理的排序问题
两个代理的单机排序问题的多项式时间算法
具有维修时间的两台平行机在线排序
工业生产中一个带有拒绝费用的工件排序问题研究
λ4-最优图的一个充分条件
λ6最优图的充分条件
泡形互连网络的条件连通性度量
图的孤立断裂度
含有两个非临界点的强连通定向图的弧数(英文)
Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube
dge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges
Conditional connectivity of star graph networks under embedding restriction
Embedding hamiltonian paths in k-ary n-cubes with conditional edge faults
Fault tolerance in bubble-sort graph networks
Fault tolerance in k-ary n-cube networks
k-Pancyclicity of k-ary n-Cube Networks under the Conditional Fault Model
Hamiltonian cycles passing through linear forests in k-ary n-cubes
Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
Embedding long cycles in faulty k-ary 2-cubes
A neighborhood condition for graphs to be maximally k-restricted edge connected
Pancyclicity of ternary n-cube networks under the conditional fault model
Sufficient conditions for maximally edge-connected graphs and arc-connected digraphs
Embeddings of hamiltonian paths in faulty k-ary 2-cubes
用对偶单纯形算法解装卸工问题
A sufficient condition for graphs to be -optimal
Strong matching preclusion for -ary -cubes
Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes
An on-line scheduling problem of parallel machines with common maintenance time
An on-line scheduling problem of paralled machines with common maintenance time
对称群上Cayley图的条件匹配排除数
Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-tra
Ordered and Hamilton Digraphs
两个代理的单机排序问题研究
一类对称群上Cayley图的最优条件匹配排除集
λ5-最优图的邻域交条件
A conjecture on k-transitive digraphs
Ordered and Ordered Hamilton Digraphs
λ5-最优图的邻域交条件
一种基于多维度信任的WSN安全数据融合方法
含有两个非临界点的强连通定向图的弧数
Ménage问题的一种粘贴DNA算法