Arjen P. A. Vestjens

According to our database1, Arjen P. A. Vestjens authored at least 10 papers between 1996 and 2007.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2007
Complexity of the job insertion problem in multi-stage scheduling.
Oper. Res. Lett., 2007

2003
Constrained Maximin Designs for Computer Experiments.
Technometrics, 2003

2002
Randomized algorithms for on-line scheduling problems: how low can't you go?
Oper. Res. Lett., 2002

2000
A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine.
SIAM J. Discret. Math., 2000

1998
Scheduling uniform machines on-line requires nondecreasing speed ratios.
Math. Program., 1998

On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time.
J. Comb. Optim., 1998

On-Line and Off-Line Approximation Algorithms for Vector Covering Problems.
Algorithmica, 1998

1997
Scheduling on identical machines: How good is LPT in an on-line setting?
Oper. Res. Lett., 1997

1996
Optimal On-Line Algorithms for Single-Machine Scheduling.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996

On-line and Off-line Approximation Algorithms for Vector Covering Problems.
Proceedings of the Algorithms, 1996


  Loading...