| 2007 |
|---|
| 9 | EE | Arjen P. A. Vestjens,
Marc Wennink,
Gerhard J. Woeginger:
Complexity of the job insertion problem in multi-stage scheduling.
Oper. Res. Lett. 35(6): 754-758 (2007) |
| 2002 |
|---|
| 8 | EE | Leen Stougie,
Arjen P. A. Vestjens:
Randomized algorithms for on-line scheduling problems: how low can't you go?
Oper. Res. Lett. 30(2): 89-96 (2002) |
| 2000 |
|---|
| 7 | EE | Han Hoogeveen,
Arjen P. A. Vestjens:
A Best Possible Deterministic On-Line Algorithm for Minimizing Maximum Delivery Time on a Single Machine.
SIAM J. Discrete Math. 13(1): 56-63 (2000) |
| 1998 |
|---|
| 6 | | Noga Alon,
Yossi Azar,
János Csirik,
Leah Epstein,
Sergey V. Sevastianov,
Arjen P. A. Vestjens,
Gerhard J. Woeginger:
On-Line and Off-Line Approximation Algorithms for Vector Covering Problems.
Algorithmica 21(1): 104-118 (1998) |
| 5 | | Bo Chen,
Arjen P. A. Vestjens,
Gerhard J. Woeginger:
On-Line Scheduling of Two-Machine Open Shops Where Jobs Arrive Over Time.
J. Comb. Optim. 1(4): 355-365 (1998) |
| 4 | | Arjen P. A. Vestjens:
Scheduling uniform machines on-line requires nondecreasing speed ratios.
Math. Program. 82: 225-234 (1998) |
| 1997 |
|---|
| 3 | EE | Bo Chen,
Arjen P. A. Vestjens:
Scheduling on identical machines: How good is LPT in an on-line setting?
Oper. Res. Lett. 21(4): 165-169 (1997) |
| 1996 |
|---|
| 2 | | Noga Alon,
János Csirik,
Sergey V. Sevastianov,
Arjen P. A. Vestjens,
Gerhard J. Woeginger:
On-line and Off-line Approximation Algorithms for Vector Covering Problems.
ESA 1996: 406-418 |
| 1 | | Han Hoogeveen,
Arjen P. A. Vestjens:
Optimal On-Line Algorithms for Single-Machine Scheduling.
IPCO 1996: 404-414 |
