位置：成果数据库 > 期刊 > 期刊详情页
Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave ma
  • ISSN号：0020-0255
  • 期刊名称：Information Sciences
  • 时间：2014.6.6
  • 页码：128-141
  • 相关项目：可中断排序相关问题研究及前沿应用
作者： 蒋义伟|Hu Jueliang|Liu Longcheng|Zhu Yuqing|Cheng T.C.E|
同期刊论文项目
可中断排序相关问题研究及前沿应用
期刊论文 15
同项目期刊论文
带提前期的供应链订货与运输最优决策问题
Preemptive scheduling on two parallel machines with a single server
ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES
图形处理中一类Flow-shop问题的改进算法
Algorithms with limited number of preemptions for scheduling on parallel machines
Optimal online algorithms on two hierarchical machines with tightly-grouped processing times
Optimal online algorithms on two hierarchical machines with resource augmentation
Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage
带机器故障的两台机带权误工数排序问题
一类三阶段供应链排序问题的近似算法
Parallel machine scheduling with a single server: loading and unloading
一类两阶段杂交流水作业的近似算法（英文）