Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference15 articles.
1. Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time;Baptiste;Math. Methods Oper. Res.,2004
2. Precedence-constrained scheduling problems parameterized by partial order width;van Bevern,2016
3. A tourist guide through treewidth;Bodlaender;Acta Cybern.,1992
4. W[2]-hardness of precedence constrained k-processor scheduling;Bodlaender;Oper. Res. Lett.,1995
5. An efficient algorithm for finding ideal schedules;Coffman;Acta Inf.,2012
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献