位置：成果数据库 > 期刊 > 期刊详情页
Preemptive scheduling with simple linear deterioration on a single machine
  • ISSN号：0304-3975
  • 期刊名称：Theoretical Computer Science
  • 时间：0
  • 页码：3578-3586
  • 相关项目：平行机分组工件排序的多面体方法
作者： Ng, C. T.|Li, Shisheng|Cheng, T. C. E.|Yuan, Jinjiang|
同期刊论文项目
平行机分组工件排序的多面体方法
期刊论文 34
同项目期刊论文
一个具有退化的两个代理的排序问题
两个代理的单机排序问题的多项式时间算法
具有维修时间的两台平行机在线排序
工业生产中一个带有拒绝费用的工件排序问题研究
Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
单可变资源最小化加权完工时间和排序问题的强NP-困难性(英文)
Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespa
Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine
Best semi-online algorithms for unbounded parallel batch scheduling
Online scheduling on batching machines to minimise the total weighted completion time of jobs with p
SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE P
Parallel-machine scheduling with deteriorating jobs and rejection
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
Unbounded parallel-batching scheduling with two competitive agents
Group scheduling and due date assignment on a single machine
An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delive
A best possible online algorithm for scheduling equal-length jobs on two machines with chain precede
两个代理的单机排序问题研究
一种基于多维度信任的WSN安全数据融合方法
赋予图均衡方向的欧拉图构造法和圈树分解法
工件带链约束和尺寸的并行批排序
单可变资源最小化加权完工时间和排序问题的强NP-困难性
两个带有分批费用的单机平行分批排序问题
最小化时间表长和最大加工运输时间的单机继列批在线排序