Normal-form preemption sequences for an open problem in scheduling theory-Reference-Cited by-同舟云学术

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

Normal-form preemption sequences for an open problem in scheduling theory

Published:2015-08-28 Issue:6 Volume:19 Page:701-728
ISSN:1094-6136
Container-title:Journal of Scheduling
language:en
Short-container-title:J Sched

Author:

Chen Bo,Coffman Ed,Dereniowski Dariusz,Kubiak Wiesław

Funder

Natural Sciences and Engineering Research Council of Canada (NSERC)

Polish National Science Center

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Management Science and Operations Research,General Engineering,Software

Link

http://link.springer.com/article/10.1007/s10951-015-0446-9/fulltext.html

Reference18 articles.

1. Baptiste, P., Brucker, P., Knust, S., & Timkovsky, V. (2004). Ten notes on equal-processing-time scheduling. 4OR, 2(2), 111–127.

2. Baptiste, P., Carlier, J., Kononov, A., Queyranne, M., Sevastyanov, S., & Sviridenko, M. (2011). Properties of optimal schedules in preemptive shop scheduling. Discrete Applied Mathematics, 159(5), 272–280.

3. Baptiste, P., & Timkovsky, V. (2001). On preemption redundancy in scheduling unit processing time jobs on two parallel machines. Operations Research Letters, 28(5), 205–212.

4. Baptiste, P., & Timkovsky, V. (2004). Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time. Mathematical Methods of Operations Research, 60(1), 145–153.

5. Brucker, P., Hurink, J., & Knust, S. (2003). A polynomial algorithm for P $$\vert \, \text{ p }_{\rm j}=1, \text{ r }_{{\rm j}}$$ | p j = 1 , r j , outtree $$\vert \, \sum {\text{ c }}_{{\rm j}}$$ | ∑ c j . Mathematical Methods of Operations Research, 56(3), 407–412.

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

1. Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion time;Journal of Scheduling;2021-09-09

2. A survey on how the structure of precedence constraints may change the complexity class of scheduling problems;Journal of Scheduling;2017-05-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3