Optimal on-line algorithms for single-machine scheduling
Author:
Publisher
Springer Berlin Heidelberg
Link
http://link.springer.com/content/pdf/10.1007/3-540-61310-2_30.pdf
Reference7 articles.
1. Chen, B., A. van Vliet, and G.J. Woeginger [1994], New lower and upper bounds for on-line scheduling, Operations Research Letters16, 221–230.
2. Graham, R.L. [1966], Bounds for certain multiprocessing anomalies, Bell System Technical Journal45, 1563–1581.
3. Kise, H., T. Ibaraki, and H. Mine [1979], Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem with ready times, Journal of the Operations Research Society of Japan22, 205–224.
4. Lawler, E. L., J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys [1993], Sequencing and scheduling: Algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin (eds.), Logistics of Production and Inventory, Handbooks in OR & MS 4, Elsevier Science Publishers B.V., Amsterdam, Chapter 9, 445–522, ISBN 0-444-8T472-0.
5. Mao, W., R.K. Kincaid, and A. Rifkin [1995], On-line algorithms for a single machine scheduling problem, in: S.G. Nash and A. Sofer (eds.), The impact of emerging technologies on computer science and operations research, Kluwer Academic Press, Chapter 8, 157–173.
Cited by 61 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling;Mathematical Programming;2024-07-22
2. Online scheduling problem of incompatible batch processing with deterioration effect and delivery time in the steel rolling process;Journal of the Operational Research Society;2024-07-18
3. Minimising total weighted completion time for semi-online single machine scheduling with known arrivals and bounded processing times;International Journal of Production Research;2023-05-31
4. A best possible online algorithm for minimizing the total completion time and the total soft penalty cost;Optimization Letters;2023-02-02
5. Competitive Kill-and-Restart and Preemptive Strategies for Non-clairvoyant Scheduling;Integer Programming and Combinatorial Optimization;2023
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3