P. Schuurman

Available identifiers

zbMath Open schuurman.petraWikidataQ2178598 ScholiaQ2178598MaRDI QIDQ1306352

List of research outcomes

Publication	Date of Publication	Type
Scheduling of pipelined operator graphs	2014-02-05	Paper
Performance guarantees of jump neighborhoods on restricted related parallel machines	2012-09-18	Paper
Performance guarantees of local search for multiprocessor scheduling	2012-06-18	Paper
Non-approximability results for scheduling problems with minsum criteria	2012-05-30	Paper
Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling	2010-04-27	Paper
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem	2008-01-18	Paper
https://portal.mardi4nfdi.de/entity/Q4448768	2004-02-18	Paper
https://portal.mardi4nfdi.de/entity/Q4414481	2003-07-25	Paper
Recognizing DNA graphs is difficult.	2003-04-28	Paper
https://portal.mardi4nfdi.de/entity/Q4793089	2003-02-18	Paper
https://portal.mardi4nfdi.de/entity/Q4537756	2002-06-20	Paper
A combinatorial property of Pallet-constrained two machine flow shop problem in minimizing makespan	2002-01-01	Paper
Approximation algorithms for the multiprocessor open shop scheduling problem	2001-09-03	Paper
A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays	2001-09-03	Paper
Approximating schedules	2001-05-06	Paper
Polynomial time approximation algorithms for machine scheduling: Ten open problems	2000-06-29	Paper
A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem	2000-06-04	Paper
https://portal.mardi4nfdi.de/entity/Q4952618	2000-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q4252357	1999-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3840371	1998-08-10	Paper
A table of state complexity bounds for binary linear codes	1997-07-15	Paper

Research outcomes over time

This page was built for person: P. Schuurman