Petra Schuurman

Publication Activity (10 Years)

Years Active: 1998-2012
Publications (10 Years): 0

Top Topics

Scheduling Problem

Parallel Machines

Precedence Constraints

Top Venues

Oper. Res. Lett.

Publications

Hans L. Bodlaender, Petra Schuurman, Gerhard J. Woeginger
Scheduling of pipelined operator graphs. J. Sched. 15 (3) (2012)
Cyriel Rutten, Diego Recalde, Petra Schuurman, Tjark Vredeveld
Performance guarantees of jump neighborhoods on restricted related parallel machines. Oper. Res. Lett. 40 (4) (2012)
Diego Recalde, Cyriel Rutten, Petra Schuurman, Tjark Vredeveld
Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling. LATIN (2010)
Petra Schuurman, Tjark Vredeveld
Performance Guarantees of Local Search for Multiprocessor Scheduling. INFORMS J. Comput. 19 (1) (2007)
Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem. Discret. Optim. 4 (2) (2007)
Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger
Recognizing DNA graphs is difficult. Discret. Appl. Math. 127 (1) (2003)
Petra Schuurman, Gerhard J. Woeginger
A PTAS for single machine scheduling with controllable processing times. Acta Cybern. 15 (3) (2002)
Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger
DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem. WG (2002)
Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger
De Bruijn Graphs and DNA Graphs. WG (2001)
Petra Schuurman, Tjark Vredeveld
Performance Guarantees of Local Search for Multiprocessor Scheduling. IPCO (2001)
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger
Non-Approximability Results for Scheduling Problems with Minsum Criteria. INFORMS J. Comput. 13 (2) (2001)
Petra Schuurman, Gerhard J. Woeginger
A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. Theor. Comput. Sci. 237 (1-2) (2000)
Petra Schuurman, Gerhard J. Woeginger
Scheduling a pipelined operator graph. SODA (2000)
Petra Schuurman, Gerhard J. Woeginger
Preemptive Scheduling with Job-Dependent Setup Times. SODA (1999)
Petra Schuurman, Gerhard J. Woeginger
Approximation algorithms for the multiprocessor open shop scheduling problem. Oper. Res. Lett. 24 (4) (1999)
Petra Schuurman
A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays. Oper. Res. Lett. 23 (1-2) (1998)
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger
Non-approximability Results for Scheduling Problems with Minsum Criteria. IPCO (1998)