On-line and Off-line Approximation Algorithms for Vector Covering Problems. - Noga Alon; János Csirik; Sergey V. Sevastianov; Arjen P. A. Vestjens; Gerhard J. Woeginger (ESA, 1996)

Optimal On-Line Algorithms for Single-Machine Scheduling. - Han Hoogeveen; Arjen P. A. Vestjens (IPCO, 1996)

Scheduling on identical machines: How good is LPT in an on-line setting? - Bo Chen 002; Arjen P. A. Vestjens (Oper. Res. Lett., 1997)

On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. - Noga Alon; Yossi Azar; János Csirik; Leah Epstein; Sergey V. Sevastianov; Arjen P. A. Vestjens; Gerhard J. Woeginger (Algorithmica, 1998)

On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time. - Bo Chen 002; Arjen P. A. Vestjens; Gerhard J. Woeginger (J. Comb. Optim., 1998)

Scheduling uniform machines on-line requires nondecreasing speed ratios. - Arjen P. A. Vestjens (Math. Program., 1998)

A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine. - Han Hoogeveen; Arjen P. A. Vestjens (SIAM J. Discret. Math., 2000)

Randomized algorithms for on-line scheduling problems: how low can't you go? - Leen Stougie; Arjen P. A. Vestjens (Oper. Res. Lett., 2002)

Constrained Maximin Designs for Computer Experiments. - Erwin Stinstra; Dick den Hertog; Peter Stehouwer; Arjen P. A. Vestjens (Technometrics, 2003)

Complexity of the job insertion problem in multi-stage scheduling. - Arjen P. A. Vestjens; Marc Wennink; Gerhard J. Woeginger (Oper. Res. Lett., 2007)