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

In this paper we discuss necessary and sufficient conditions for different minimax results to hold using only linear programming duality and the finite intersection property of compact sets. It turns out that these necessary and sufficient conditions have a clear interpretation within zero-sum...

In most multi-item inventory systems, the ordering costs consist of a major cost and a minor cost for each item included. Applying for every individual item a cyclic inventory policy, where the cycle length is a multiple of some basic cycle time, reduces the major ordering costs. An efficient...

In this paper we discuss a general framework for single component replacement models. This framework is based on the regenerative structure of these models and by using results from renewal theory a unified presentation of the discounted and average finite and infinite horizon cost models is...

In this chapter we give an overview on the theory of noncooperative games. In the first part we consider in detail for zero-sum (and constant-sum) noncooperative games under which necessary and sufficient conditions on the payoff function and different (extended) strategy sets for both players...

In this paper we will discuss a general framework for single item inventory models based on the theory of regenerative processes. After resenting without proof the main theorems for regenerative processes we analyze in detail how the different single item models can be embedded within this...

In this paper we review and unify some of the classes of generalized convex functions introduced by different authors to prove minimax results in infinite dimensional spaces and show the relations between those classes. We also list for the most general class already introduced by Jeyakumar an...