In this note we derive the expected total discounted profit of an insurer due to a single policy holder within a third-party liability insurance. We consider both a policy holder claiming optimally and non-optimally.

In this paper we analyse the optimal claim behaviour of a policy holder having a third-party liability insurance in which one is allowed to decide at the end of an insurance year which damages occurred during that year should be claimed. This analysis can only be carried out in detail in case...

In the dual bin packing problem, the objective is to assign items of given size to the largest possible number of bins, subject to the constraint that the total size of the items assigned to any bin is at least equal to 1. We carry out a probabilistic analysis of this problem under the...

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...

We consider an economic order quantity type model with unit out-of-pocket holding costs, unit opportunity costs of holding, fixed ordering costs and general transportation costs. For these models, we analyze the associated optimization problem and derive an easy procedure for determining a...

A probabilistic analysis is presented of the Next Fit Decreasing bin packing heuristic, in which bins are opened to accomodate the items in order of decreasing size.

In this note we present a simplified proof of a lower bound for on-line bin packing. This proof also covers the well-known result given by Liang in Inform. Process Lett. 10 (1980) 76–79.

The LPT rule is a heuristic method to distribute jobs among identical machines so as to minimize the makespan of the resulting schedule. If the processing times of the jobs are assumed to be independent identically distributed random variables, then (under a mild condition on the distribution)...

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...

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...