A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack-Reference-Cited by-同舟云学术

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

A parameterized complexity view on non-preemptively scheduling interval-constrained jobs: few machines, small looseness, and small slack

Published:2016-04-08 Issue:3 Volume:20 Page:255-265
ISSN:1094-6136
Container-title:Journal of Scheduling
language:en
Short-container-title:J Sched

Author:

van Bevern René,Niedermeier Rolf,Suchý Ondřej

Funder

Grantová Agentura České Republiky

Russian Foundation for Basic Research

Publisher

Springer Science and Business Media LLC

Subject

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

Link

http://link.springer.com/content/pdf/10.1007/s10951-016-0478-9.pdf

Reference25 articles.

1. van Bevern, R. (2014). Towards optimal and expressive kernelization for $$d$$ d -hitting set. Algorithmica, 70(1), 129–147.

2. van Bevern, R., Chen, J., Hüffner, F., Kratsch, S., Talmon, N., & Woeginger, G. J. (2015a). Approximability and parameterized complexity of multicover by $$c$$ c -intervals. Information Processing Letters, 115(10), 744–749.

3. van Bevern, R., Mnich, M., Niedermeier, R., & Weller, M. (2015b). Interval scheduling and colorful independent sets. Journal of Scheduling, 18(5), 449–469.

4. Bodlaender, H. L., & Fellows, M. R. (1995). W[2]-hardness of precedence constrained $$k$$ k -processor scheduling. Operations Research Letters, 18(2), 93–97.

5. Chen, L., Megow, N., & Schewior, K. (2016). An $$O(\log m)$$ O ( log m ) -competitive algorithm for online machine minimization. In Proceedings of the 27th annual ACM-SIAM symposium on discrete algorithms (SODA’16), pp. 155–163. SIAM.

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

1. On the parameterized complexity of interval scheduling with eligible machine sets;Journal of Computer and System Sciences;2024-09

2. Two is better than one? Order aggregation in a meal delivery scheduling problem;Computers & Industrial Engineering;2023-09

3. Efficient Production Scheduling by Exploiting Repetitive Product Configurations;2023 IEEE 21st International Conference on Industrial Informatics (INDIN);2023-07-18

4. A multivariate complexity analysis of the material consumption scheduling problem;Journal of Scheduling;2023-01-14

5. Equitable scheduling on a single machine;Journal of Scheduling;2022-09-19

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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