PROFILE SCHEDULING OF OPPOSING FORESTS AND LEVEL ORDERS

[1] Aho A. V., 1974, The design and analysis of computer algorithms

[2] BRUNO J, 1981, JUL NATO C DURH

[3] Coffman E.G., 1976, Computer and Job-Shop Scheduling Theory

[4] Coffman E. G. Jr., 1972, Acta Informatica, V1, P200, DOI 10.1007/BF00288685

[5] SCHEDULING PRECEDENCE GRAPHS OF BOUNDED HEIGHT [J]. JOURNAL OF ALGORITHMS, 1984, 5 (01) : 48 - 59

[6] DOLEV D, 1984, 8404 HEBR U RES REP

[7] CORRECTION [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1971, 20 (01) : 141 - &

[8] OPTIMAL SEQUENCING OF 2 EQUIVALENT PROCESSORS [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (04) : 784 - &

[9] A LINEAR-TIME RECOGNITION ALGORITHM FOR INTERVAL DAGS [J]. INFORMATION PROCESSING LETTERS, 1981, 12 (01) : 20 - 22

[10] AN ALMOST-LINEAR ALGORITHM FOR 2-PROCESSOR SCHEDULING [J]. JOURNAL OF THE ACM, 1982, 29 (03) : 766 - 780

[1] Aho A. V., 1974, The design and analysis of computer algorithms

[2] BRUNO J, 1981, JUL NATO C DURH

[3] Coffman E.G., 1976, Computer and Job-Shop Scheduling Theory

[4] Coffman E. G. Jr., 1972, Acta Informatica, V1, P200, DOI 10.1007/BF00288685

[5] SCHEDULING PRECEDENCE GRAPHS OF BOUNDED HEIGHT [J]. JOURNAL OF ALGORITHMS, 1984, 5 (01) : 48 - 59

[6] DOLEV D, 1984, 8404 HEBR U RES REP

[7] CORRECTION [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1971, 20 (01) : 141 - &

[8] OPTIMAL SEQUENCING OF 2 EQUIVALENT PROCESSORS [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1969, 17 (04) : 784 - &

[9] A LINEAR-TIME RECOGNITION ALGORITHM FOR INTERVAL DAGS [J]. INFORMATION PROCESSING LETTERS, 1981, 12 (01) : 20 - 22

[10] AN ALMOST-LINEAR ALGORITHM FOR 2-PROCESSOR SCHEDULING [J]. JOURNAL OF THE ACM, 1982, 29 (03) : 766 - 780