http://repub.eur.nl/res/aut/14426/ List of Publications en http://repub.eur.nl/static-eur/img/logo.png http://repub.eur.nl http://repub.eur.nl/res/pub/11742/ 1994-05-01T00:00:00Z In this paper we present two algorithms for a machine allocation problem occurring in manufacturing systems. For the two algorithms presented we prove worst-case performance ratios of 2 and 312, respectively. The machlne allocat~on problem we consider is a general convex resource allocation problem, which makes the algorithms applicable to a varlety of resource allocation problems. Numerical results are presented for two real-life manufacturing systems. http://repub.eur.nl/res/pub/11700/ 1993-09-03T00:00:00Z The first algorithms for the on-line two-dimensional rectangle packing problem were introduced by Coppersmith and Raghavan. They showed that for a family of heuristics 13/4 is an upper bound for the asymptotic worst-case ratios. We have investigated the Next Fit and the First Fit variants of their method. We proved that the asymptotic worst-case ratio equals 13/4 for the Next Fit variant and that 49/16 is an upper bound of the asymptotic worst-case ratio for the First Fit variant. http://repub.eur.nl/res/pub/11643/ 1993-05-01T00:00:00Z In this note we give a short and easy proof of the equivalence of Hakimi's one-median problem and the k-server-facility-loss median problem as discussed by Chiu and Larson in Computer and Operation Research. The proof makes only use of a stochastic monotonicity result for birth and death processes and the insensitivity of the M/G/k/k loss model. http://repub.eur.nl/res/pub/11738/ 1990-01-01T00:00:00Z