Petra Schuurman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 17 from 17

2012

Scheduling of pipelined operator graphsHans L. Bodlaender, Petra Schuurman, Gerhard J. Woeginger. scheduling, 15(3):323-332, 2012. [doi]

Performance guarantees of jump neighborhoods on restricted related parallel machinesCyriel Rutten, Diego Recalde, Petra Schuurman, Tjark Vredeveld. orl, 40(4):287-291, 2012. [doi]

2010

Local Search Performance Guarantees for Restricted Related Parallel Machine SchedulingDiego Recalde, Cyriel Rutten, Petra Schuurman, Tjark Vredeveld. latin 2010: 108-119 [doi]

2007

A polynomial time equivalence between DNA sequencing and the exact perfect matching problemJacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger. disopt, 4(2):154-162, 2007. [doi]

Performance Guarantees of Local Search for Multiprocessor SchedulingPetra Schuurman, Tjark Vredeveld. informs, 19(1):52-63, 2007. [doi]

2003

Recognizing DNA graphs is difficultRudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger. DAM, 127(1):85-94, 2003.

2002

DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching ProblemJacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger. criwg 2002: 13-24 [doi]

A PTAS for single machine scheduling with controllable processing timesPetra Schuurman, Gerhard J. Woeginger. actaC, 15(3):369-378, 2002. [doi]

2001

Non-Approximability Results for Scheduling Problems with Minsum CriteriaHan Hoogeveen, Petra Schuurman, Gerhard J. Woeginger. informs, 13(2):157-168, 2001. [doi]

De Bruijn Graphs and DNA GraphsRudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger. criwg 2001: 296-305 [doi]

Performance Guarantees of Local Search for Multiprocessor SchedulingPetra Schuurman, Tjark Vredeveld. ipco 2001: 370-382 [doi]

2000

A polynomial time approximation scheme for the two-stage multiprocessor flow shop problemPetra Schuurman, Gerhard J. Woeginger. TCS, 237(1-2):105-122, 2000. [doi]

Scheduling a pipelined operator graphPetra Schuurman, Gerhard J. Woeginger. soda 2000: 207-212 [doi]

1999

Approximation algorithms for the multiprocessor open shop scheduling problemPetra Schuurman, Gerhard J. Woeginger. orl, 24(4):157-163, 1999. [doi]

Preemptive Scheduling with Job-Dependent Setup TimesPetra Schuurman, Gerhard J. Woeginger. soda 1999: 759-767 [doi]

1998

Non-approximability Results for Scheduling Problems with Minsum CriteriaHan Hoogeveen, Petra Schuurman, Gerhard J. Woeginger. ipco 1998: 353-366 [doi]

A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delaysPetra Schuurman. orl, 23(1-2):9-11, 1998. [doi]

Sign in or sign up to see more results.

runs on WebDSL