Arjen P. A. Vestjens - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 10 from 10

2007

Complexity of the job insertion problem in multi-stage schedulingArjen P. A. Vestjens, Marc Wennink, Gerhard J. Woeginger. orl, 35(6):754-758, 2007. [doi]

2003

Constrained Maximin Designs for Computer ExperimentsErwin Stinstra, Dick den Hertog, Peter Stehouwer, Arjen P. A. Vestjens. technometrics, 45(4):340-346, 2003. [doi]

2002

Randomized algorithms for on-line scheduling problems: how low can t you go?Leen Stougie, Arjen P. A. Vestjens. orl, 30(2):89-96, 2002. [doi]

2000

A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single MachineHan Hoogeveen, Arjen P. A. Vestjens. siamdm, 13(1):56-63, 2000. [doi]

1998

On-Line and Off-Line Approximation Algorithms for Vector Covering ProblemsNoga Alon, Yossi Azar, János Csirik, Leah Epstein, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger. algorithmica, 21(1):104-118, 1998.

On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over TimeBo Chen, Arjen P. A. Vestjens, Gerhard J. Woeginger. jco, 1(4):355-365, 1998.

Scheduling uniform machines on-line requires nondecreasing speed ratiosArjen P. A. Vestjens. mp, 82:225-234, 1998.

1997

Scheduling on identical machines: How good is LPT in an on-line setting?Bo Chen, Arjen P. A. Vestjens. orl, 21(4):165-169, 1997. [doi]

1996

On-line and Off-line Approximation Algorithms for Vector Covering ProblemsNoga Alon, János Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger. esa 1996: 406-418

Optimal On-Line Algorithms for Single-Machine SchedulingHan Hoogeveen, Arjen P. A. Vestjens. ipco 1996: 404-414

Sign in or sign up to see more results.

runs on WebDSL