Parameterized complexity of machine scheduling: 15 open problems.
Computers & Operations Research（2018）
摘要
•Recent work on the parameterized complexity of scheduling problems is summarized.•Results before the advent of parameterized complexity are reinterpreted in its terms.•15 challenging open questions on parameterized complexity are posed.
更多查看译文
关键词
Parallel machines,Shop scheduling,Makespan,Total completion time,Total tardiness,Throughput,Number of tardy jobs
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要