Funder
China Sponsorship Council
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference11 articles.
1. Baptiste, P., & Timkovsky, V. G. (2001). On preemption redundancy in scheduling unit processing time jobs on two parallel machines. Operations Research Letters, 28(5), 205–212.
2. Baptiste, P., Brucker, P., Knust, S., & Timkovsky, V. G. (2004). Ten notes on equal-processing-time scheduling. Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 2(2), 111–127.
3. Brucker, P., Hurink, J., & Knust, S. (2003). A polynomial algorithm for
$${P}|p_j=1, r_j, outtree|\sum {C}_j$$
P
|
p
j
=
1
,
r
j
,
o
u
t
t
r
e
e
|
∑
C
j
. Mathematical Methods of Operations Research, 56(3), 407–412.
4. Garey, M., Johnson, D., Tarjan, R., & Yannakakis, M. (1983). Scheduling opposing forests. SIAM Journal on Algebraic Discrete Methods, 4(1), 72–93.
5. Garey, M. R., & Johnson, D. S. (2002). Computers and intractability (Vol. 29). New York: W. H. Freeman.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献