Petra Schuurman

According to our database, Petra Schuurman authored at least 15 papers between 1998 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2012

Scheduling of pipelined operator graphs.

Hans L. Bodlaender, Petra Schuurman, Gerhard J. Woeginger

J. Sched., 2012

Performance guarantees of jump neighborhoods on restricted related parallel machines.

Cyriel Rutten, Diego Recalde, Petra Schuurman, Tjark Vredeveld

Oper. Res. Lett., 2012

2010

Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling.

Diego Recalde, Cyriel Rutten, Petra Schuurman, Tjark Vredeveld

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2007

Performance Guarantees of Local Search for Multiprocessor Scheduling.

Petra Schuurman, Tjark Vredeveld

INFORMS J. Comput., 2007

A polynomial time equivalence between DNA sequencing and the exact perfect matching problem.

Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger

Discret. Optim., 2007

2003

Recognizing DNA graphs is difficult.

Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger

Discret. Appl. Math., 2003

2002

A PTAS for single machine scheduling with controllable processing times.

Petra Schuurman, Gerhard J. Woeginger

Acta Cybern., 2002

DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem.

Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001

Non-Approximability Results for Scheduling Problems with Minsum Criteria.

Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger

INFORMS J. Comput., 2001

De Bruijn Graphs and DNA Graphs.

Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

2000

A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem.

Petra Schuurman, Gerhard J. Woeginger

Theor. Comput. Sci., 2000

Scheduling a pipelined operator graph.

Petra Schuurman, Gerhard J. Woeginger

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Approximation algorithms for the multiprocessor open shop scheduling problem.

Petra Schuurman, Gerhard J. Woeginger

Oper. Res. Lett., 1999

Preemptive Scheduling with Job-Dependent Setup Times.

Petra Schuurman, Gerhard J. Woeginger

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays.

Petra Schuurman

Oper. Res. Lett., 1998