.png){kind=icon}
返回
Parameterized complexity of machine scheduling: 15 open problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2018.07.020.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Machine scheduling problems are a long-time key domain of algorithms and complexity research. A novel approach to machine scheduling problems are fixed-parameter algorithms. To stimulate this thriving research direction, we propose 15 open questions in this area whose resolution we expect to lead to the discovery of new approaches and techniques both in scheduling and parameterized complexity theory. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Parallel machines
Shop scheduling
Makespan
Total completion time
Total tardiness
Throughput
Number of tardy jobs
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
On minimizing the weighted number of late jobs in unit execution time open-shops关于最小化单位执行时间开店中迟到作业的加权数
PREAI
分享收藏
查看更多内容