An Improved Lower Bound for On-Line Bin Packing Algorithms. - André van Vliet (Inf. Process. Lett., 1992)

An on-line algorithm for multidimensional bin packing. - János Csirik; André van Vliet (Oper. Res. Lett., 1993)

Lower bounds for 1-, 2- and 3-dimensional on-line bin packing algorithms. - Gábor Galambos; André van Vliet (Computing, 1994)

A Lower Bound for Randomized On-Line Scheduling Algorithms. - Bo Chen 002; André van Vliet; Gerhard J. Woeginger (Inf. Process. Lett., 1994)

New lower and upper bounds for on-line scheduling. - Bo Chen 002; André van Vliet; Gerhard J. Woeginger (Oper. Res. Lett., 1994)

An optimal algorithm for preemptive on-line scheduling. - Bo Chen 002; André van Vliet; Gerhard J. Woeginger (Oper. Res. Lett., 1995)

On the Asymptotic Worst Case Behavior of Harmonic Fit. - André van Vliet (J. Algorithms, 1996)

Ordinal algorithms for parallel machine scheduling. - Wei-Ping Liu; Jeffrey B. Sidney; André van Vliet (Oper. Res. Lett., 1996)

A Note on "An On-Line Scheduling Heuristic with Better Worst Case Ratio than Graham's List Scheduling". - R. Chandrasekaran; Bo Chen 002; Gábor Galambos; P. R. Narayanan; André van Vliet (SIAM J. Comput., 1997)

Minimising bins in transmission systems. - Thomas W. Archibald; Menno B. Bokkers; Rommert Dekker; André van Vliet (Eur. J. Oper. Res., 1999)