Comparing the minimum completion times of two longest-first scheduling-heuristics
Author:
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research
Link
http://link.springer.com/content/pdf/10.1007/s10100-011-0217-4.pdf
Reference11 articles.
1. Arnold BC, Balakrishnan N, Nagaraja HN (1992) A first course in order statistics. Wiley, New York
2. Azar Y, Epstein L (1997) On-line machine covering. Lect Notes Comput Sci 1284: 23–36
3. Coffman EG Jr, Langston MA (1984) A performance guarantee for the greedy set-partitioning algorithm. Acta Informatica 21: 409–415
4. Coffman EG Jr, Sethi R (1976) Algorithms minimizing mean flow time: schedule-length properties. Acta Informatica 6: 1–14
5. Csirik J, Kellerer H, Woeginger G (1992) The exact LPT-bound for maximizing the minimum completion time. Oper Res Lett 11: 281–287
Cited by 8 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Survey on Task Scheduling Optimization Strategy under Multi-Cloud Environment;Computer Modeling in Engineering & Sciences;2023
2. Parallel-machine scheduling with identical machine resource capacity limits and DeJong’s learning effect;International Journal of Production Research;2021-03-30
3. Adaptive Partition Migration for Irregular Graph Algorithms on Elastic Resources;2019 IEEE 12th International Conference on Cloud Computing (CLOUD);2019-07
4. On Optimality Conditions for Job Scheduling on Uniform Parallel Machines;Advances in Computer Science for Engineering and Education II;2019-03-29
5. Reduction criteria, upper bounds, and a dynamic programming based heuristic for the max–min $$k_i$$ k i -partitioning problem;Journal of Heuristics;2017-12-08
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3