A. van Vliet (AndrĂ©)
http://repub.eur.nl/ppl/3083/
List of Publications
en
http://repub.eur.nl/eur_signature.png
http://repub.eur.nl/
RePub, Erasmus University Repository

Minimising bins in transmission systems
http://repub.eur.nl/pub/2268/
Tue, 01 Jun 1999 00:00:01 GMT
<div>T.W. Archibald</div><div>M. Bokkers</div><div>R. Dekker</div><div>A. van Vliet</div>
This paper deals with the problem of minimising the transmission cost in an EDI system and proves the optimality of a policy which minimizes the slack of partial sums under conditions with practical interpretations. This policy is shown to be useful as a heuristic in more general cases.

Ordinal algorithms for parallel machine scheduling
http://repub.eur.nl/pub/71567/
Fri, 01 Mar 1996 00:00:01 GMT
<div>W.P. Liu</div><div>J.B. Sidney</div><div>A. van Vliet</div>

On the Asymptotic Worst Case Behavior of Harmonic Fit
http://repub.eur.nl/pub/58358/
Mon, 01 Jan 1996 00:00:01 GMT
<div>A. van Vliet</div>
In the parametric bin packing problem we must pack a list of items with size smaller than or equal to 1/r in a minimal number of unitcapacity bins. Among the approximation algorithms, the class of Harmonic Fit algorithms (HFM) plays an important role. Lee and Lee (J. Assoc. Comput. Mach. 32 (1985), 562572) and Galambos (Ann. Univ. Sci. Budapest Sect. Comput. 9 (1988), 121126) provide upper bounds for the asymptotic worst case ratio of HFM and show tightness for certain values of the parameter M. In this paper we provide worst case examples that meet the known upper bound for additional values of M, and we show that for remaining values of M the known upper bound is not tight. For the classical bin packing problem (r = 1), we prove an asymptotic worst case ratio of 12/7 for the case M = 4 and 1.7 for the case M = 5. We give improved lower bounds for some interesting cases that are left open.

Lower bounds for 1, 2 and 3dimensional online bin packing algorithms
http://repub.eur.nl/pub/71894/
Thu, 01 Sep 1994 00:00:01 GMT
<div>G. Galambos</div><div>A. van Vliet</div>
In this paper we discuss lower bounds for the asymptotic worst case ratio of online algorithms for different kind of bin packing problems. Recently, Galambos and Frenk gave a simple proof of the 1.536 ... lower bound for the 1dimensional bin packing problem. Following their ideas, we present a general technique that can be used to derive lower bounds for other bin packing problems as well. We apply this technique to prove new lower bounds for the 2dimensional (1.802...) and 3dimensional (1.974...) bin packing problem.

An improved lower bound for online bin packing algorithms
http://repub.eur.nl/pub/76720/
Tue, 01 Dec 1992 00:00:01 GMT
<div>A. van Vliet</div>