Online Scheduling with Hard Deadlines-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Online Scheduling with Hard Deadlines

Published:2000-02 Issue:2 Volume:34 Page:370-389
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Goldman Sally A,Parwatikar Jyoti,Suri Subhash

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference13 articles.

1. Throughput-competitive on-line routing;Awerbuch,1993

2. Competitive routing of virtual circuits with unknown durations;Awerbuch,1994

3. Competitive non-preemptive call control;Awerbuch,1994

4. On-line admission control and circuit routing for high performance computing and communication;Awerbuch,1994

5. On the power of randomization in on-line algorithms;Ben-David;Algorithmica,1994

Cited by 38 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A New Approach to Capacity Scaling Augmented with Unreliable Machine Learning Predictions;Mathematics of Operations Research;2023-04-13

2. Commitment and Slack for Online Load Maximization;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06

3. Online Routing and Scheduling With Capacity Redundancy for Timely Delivery Guarantees in Multihop Networks;IEEE/ACM Transactions on Networking;2019-06

4. Online scheduling of jobs with kind release times and deadlines on a single machine;Applied Mathematics-A Journal of Chinese Universities;2019-03

5. Efficient Mechanism Design for Online Scheduling;Journal of Artificial Intelligence Research;2016-07-27

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP