The following pages link to Petra Schuurman (Q1306352):
Displayed 22 items.
- Item:Q1306352 (redirect page) (← links)
- Performance guarantees of jump neighborhoods on restricted related parallel machines (Q453054) (← links)
- Approximation algorithms for the multiprocessor open shop scheduling problem (Q1306353) (← links)
- A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays (Q1306465) (← links)
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem (Q1566707) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- Recognizing DNA graphs is difficult. (Q1868714) (← links)
- A combinatorial property of Pallet-constrained two machine flow shop problem in minimizing makespan (Q1868959) (← links)
- Scheduling of pipelined operator graphs (Q2434287) (← links)
- A polynomial time equivalence between DNA sequencing and the exact perfect matching problem (Q2467125) (← links)
- (Q2711195) (← links)
- Non-Approximability Results for Scheduling Problems with Minsum Criteria (Q2884502) (← links)
- Performance Guarantees of Local Search for Multiprocessor Scheduling (Q2892310) (← links)
- A table of state complexity bounds for binary linear codes (Q3129486) (← links)
- Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling (Q3557013) (← links)
- (Q3840371) (← links)
- (Q4252357) (← links)
- (Q4414481) (← links)
- (Q4448768) (← links)
- (Q4537756) (← links)
- (Q4793089) (← links)
- (Q4952618) (← links)