( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Scheduling of pipelined operator graphs.

, , и . J. Sched., 15 (3): 323-332 (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Peter Petrausch

Heinrich Petram

Matthias Petran

Oskar Peter Petrasch

Rainer Petrasch

 

Другие публикации лиц с тем же именем

Performance Guarantees of Local Search for Multiprocessor Scheduling., и . IPCO, том 2081 из Lecture Notes in Computer Science, стр. 370-382. Springer, (2001)Scheduling a pipelined operator graph., и . SODA, стр. 207-212. ACM/SIAM, (2000)Preemptive Scheduling with Job-Dependent Setup Times., и . SODA, стр. 759-767. ACM/SIAM, (1999)Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling., , , и . LATIN, том 6034 из Lecture Notes in Computer Science, стр. 108-119. Springer, (2010)Non-approximability Results for Scheduling Problems with Minsum Criteria., , и . IPCO, том 1412 из Lecture Notes in Computer Science, стр. 353-366. Springer, (1998)De Bruijn Graphs and DNA Graphs., , и . WG, том 2204 из Lecture Notes in Computer Science, стр. 296-305. Springer, (2001)Performance Guarantees of Local Search for Multiprocessor Scheduling., и . INFORMS J. Comput., 19 (1): 52-63 (2007)A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays.. Oper. Res. Lett., 23 (1-2): 9-11 (1998)Approximation algorithms for the multiprocessor open shop scheduling problem., и . Oper. Res. Lett., 24 (4): 157-163 (1999)A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem., и . Theor. Comput. Sci., 237 (1-2): 105-122 (2000)