The triangle scheduling problem

J. Scheduling, Volume abs/1602.04365, Issue 3, 2018.

被引用5|浏览36
EI

摘要

This paper introduces a novel scheduling problem, where jobs occupy a triangular shape on the time line. This problem is motivated by scheduling jobs with different criticality levels. A measure is introduced, namely the . It is shown that the Greedy algorithm solves the problem to optimality when the binary tree ratio of the input instan...更多

代码

数据

上传PDF

1.系统将在24h内对您上传的文档进行审核,上传无误计入您账户;

2.由于当前系统不支持提现,可添加工作人员微信(AMxiaomai)以红包领取。

3.10积分币兑换1元。

?

上传单篇

获得5个积分币

微信红包
?

上传50篇

获得280个积分币

微信红包
?

上传200篇

获得1200个积分币

微信红包
?

上传500篇

获得3000个积分币

微信红包
?

上传1000篇

获得7000个积分币

微信红包
您的评分 :
0

 

标签
评论