位置：成果数据库 > 期刊 > 期刊详情页
An on-line scheduling problem of parallel machines with common maintenance time
  • ISSN号：1009-6124
  • 期刊名称：Journal of Systems Science and Complexity
  • 时间：2013
  • 页码：201-208
  • 分类：O224[理学—运筹学与控制论;理学—数学] P315.5[天文地球—地震学;天文地球—固体地球物理学;天文地球—地球物理学]
  • 作者机构：[1]Department of Mathematics, Zhengzhou University, Zhengzhou 450001, China, [2]College of Science, Zhongyuan University of Technology, Zhengzhou 450007, China, [3]Department of Mathematics, Zhengzhou University, Zhcngzhou 450001
  • 相关基金：This research is supported by the National Natural Science Foundation of China under Grant Nos. 11271338, 11171313, 61070229, 10901144, 11001117, and supported by the Ph.D. Programs Foundation of Ministry of Education of China under Grant No. 20111401110005, and the Henan Province Natural Science Foundation under Grant No. 112300410047.
  • 相关项目：多阶段集成排序和退化机器环境下排序的理论研究
作者： Feng Qi|Li Wenjie|Shang Weiping|Cai Yuhua|
关键词： 时间间隔, 调度问题, 并行机, 维护, 在线算法, 竞争比, 竞争力, 作者, Nonresumable availability, on-line algorithm, parallel machines scheduling.
中文摘要：

Email： fengqishuxue@126.com. Corresponding authorEmail： liwenjie0521@ 163.com.

同期刊论文项目
无线网络中一些图论与组合优化问题
期刊论文 19 会议论文 4
多阶段集成排序和退化机器环境下排序的理论研究
期刊论文 17 会议论文 1
在线和离线折衷排序研究
期刊论文 3
基于调度管理与客户利益之间平衡的排序问题
期刊论文 49
网络可靠性参数的优化研究
期刊论文 60 会议论文 2
同项目期刊论文
Scheduling problems with rejection to minimize the maximum flow time
Rescheduling to Minimize Total Completion Time Under a Limit Time Disruption for the Parallel Batch
Fault-free Hamiltonian cycles passing through a linear forest in ternary -cubes with faulty edges
Many-to-many disjoint path covers in -ary -cubes
A semi-on-line scheduling problem of two parallel machines with common maintenance time
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 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算法
Bi-criteria scheduling on a single parallel-batch machine
A revised proof of the optimality for the Kise-Ibaraki-Mine algorithm
Bounded parallel-batching scheduling with two competing agents
A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum l
On-line scheduling with rejection on uniform parallel machines
Unbounded parallel-batch scheduling with family jobs and delivery coordination
排序博弈的分类、进展和展望
改进的GM（1,1）灰色预测模型及其应用
基于快速二维熵的加权模糊C均值聚类图像分割
容器变位识别与容量表标定模型研究
带有交货期窗口和工件可拒绝的单机排序问题
绕曲线旋转母线长度不变性及其应用
可拒绝的同类机在线排序（英文）
《概率论与数理统计》教学实践与探索
工件按加工长度不增序到达的最小化最大流程在线分批排序
Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum
On the vertex-arboricity of -minor-free graphs of diameter 2
Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disru
Online scheduling on a single machine with rejection under an agreeable condition to minimize the to
Primary–secondary bicriteria scheduling on identical machines to minimize the total completion time
A best possible online algorithm for scheduling to minimize maximum flow-time on bounded batch machi
Preemptive scheduling on identical machines with delivery coordination to minimize the maximum deliv
LPT online strategy for parallel-machine scheduling with kind release times
Fast approximation algorithms for bi-criteria scheduling with machine assignment costs
带有分批费用的容量有界的单机平行分批排序问题
Online bounded-batch scheduling to minimize total weighted completion time on parallel machines
Online scheduling of incompatible unit-length job families with lookahead
Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families
Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness
A note on the preemptive scheduling to minimize total completion time with release time and deadline
A note on reverse scheduling with maximum lateness objective
A note on Pareto minimizing total completion time and maximum cost
Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates
两个带有分批费用的平行分批排序问题的算法
最小化总完工时间与分批费用之和的有界分批排序问题
具有前瞻区间的两个工件组单机在线排序问题
具有相同批容量和相同工期的单机准时分批排序问题
Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
Online-List Scheduling on a Single Bounded Parallel-Batch Machine to Minimize Makespan
Two-agent single-machine scheduling with release dates and preemption to minimize the maximum latene
Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maxi
两个代理的单机排序问题的多项式时间算法
关于极大二部匹配可扩图
Roman domiantion and its variants in unit disk graphs
偶匹配可扩性的极图问题(英文)
关于元爪图的一个性质(英文)
Algorithms for minimum connected capacitated dominating set problem
Two models of two-dimensional bandwidth problems
SQUARE-ROOT RULE OF TWO-DIMENSIONAL BANDWIDTH PROBLEM
A characterization of PM-compact bipartite and near-bipartite graphs
4-regular bipartite matching extendable graphs.
两个代理的单机这排序问题的多项式时间算法
两个代理的单机排序问题研究
基于蛛网模型理论的柑橘生产和价格波动分析
A Property of Claw-free Graphs
基于萤火虫群的无线传感器网络节点定位方法
一种基于粒子群的实际业务流预测算法
具有多重公共工期的单机退化工件排序
Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited r
Online scheduling of equal length jobs on unbounded parallel batch processing machines with limited
期刊信息
  • 《系统科学与复杂性学报：英文版》
  • 主管单位:中国科学院
  • 主办单位:中国科学院系统科学研究所
  • 主编：
  • 地址：北京东黄城根北街16号
  • 邮编：100080
  • 邮箱：
  • 电话：010-62541831 62541834
  • 国际标准刊号：ISSN：1009-6124
  • 国内统一刊号：ISSN：11-4543/O1
  • 邮发代号:82-545
  • 获奖情况:
  • 国内外数据库收录:
  • 俄罗斯文摘杂志,美国数学评论（网络版）,德国数学文摘,荷兰文摘与引文数据库,美国工程索引,美国科学引文索引（扩展库）,英国科学文摘数据库
  • 被引量:125