default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetra Schuurman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j10]Cyriel Rutten, Diego Recalde, Petra Schuurman, Tjark Vredeveld:
Performance guarantees of jump neighborhoods on restricted related parallel machines. Oper. Res. Lett. 40(4): 287-291 (2012)- [j9]Hans L. Bodlaender
, Petra Schuurman, Gerhard J. Woeginger:
Scheduling of pipelined operator graphs. J. Sched. 15(3): 323-332 (2012) - 2010
- [c7]Diego Recalde, Cyriel Rutten, Petra Schuurman, Tjark Vredeveld:
Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling. LATIN 2010: 108-119
2000 – 2009
- 2007
- [j8]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): 154-162 (2007) - [j7]Petra Schuurman, Tjark Vredeveld:
Performance Guarantees of Local Search for Multiprocessor Scheduling. INFORMS J. Comput. 19(1): 52-63 (2007) - 2003
- [j6]Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger:
Recognizing DNA graphs is difficult. Discret. Appl. Math. 127(1): 85-94 (2003) - 2002
- [j5]Petra Schuurman, Gerhard J. Woeginger:
A PTAS for single machine scheduling with controllable processing times. Acta Cybern. 15(3): 369-378 (2002) - [c6]Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Petra Schuurman, Gerhard J. Woeginger:
DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem. WG 2002: 13-24 - 2001
- [j4]Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger:
Non-Approximability Results for Scheduling Problems with Minsum Criteria. INFORMS J. Comput. 13(2): 157-168 (2001) - [c5]Petra Schuurman, Tjark Vredeveld:
Performance Guarantees of Local Search for Multiprocessor Scheduling. IPCO 2001: 370-382 - [c4]Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger:
De Bruijn Graphs and DNA Graphs. WG 2001: 296-305 - 2000
- [j3]Petra Schuurman, Gerhard J. Woeginger:
A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem. Theor. Comput. Sci. 237(1-2): 105-122 (2000) - [c3]Petra Schuurman, Gerhard J. Woeginger:
Scheduling a pipelined operator graph. SODA 2000: 207-212
1990 – 1999
- 1999
- [j2]Petra Schuurman, Gerhard J. Woeginger:
Approximation algorithms for the multiprocessor open shop scheduling problem. Oper. Res. Lett. 24(4): 157-163 (1999) - [c2]Petra Schuurman, Gerhard J. Woeginger:
Preemptive Scheduling with Job-Dependent Setup Times. SODA 1999: 759-767 - 1998
- [j1]Petra Schuurman:
A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays. Oper. Res. Lett. 23(1-2): 9-11 (1998) - [c1]Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger:
Non-approximability Results for Scheduling Problems with Minsum Criteria. IPCO 1998: 353-366
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
