The imperative to improve healthcare efficiency is now stronger than ever. Rapidly increasing healthcare demand and the prospect of healthcare cost exploding require that measures be taken to make healthcare organizations become more efficiency-aware. Alignment of organizational interests is...

In this paper we consider a two-dimensional cutting stock problem encountered at a large manufacturer of window covering products. The problem occurs in the production process of made-to-measure roller blinds. We develop a solution method that takes into account the characteristics of the...

In this paper we analyze the worst case performance of heuristics for the classical economic lot-sizing problem with time-invariant cost parameters. We consider a general class of on-line heuristics that is often applied in a rolling horizon environment. We develop a procedure to systematically...

The Dutch national road network has been developed over several decades. In the past, roads were constructed according to the then current spatial and transportation planning philosophies. Because the existing road network is a result of a long process of successive developments, the question...

We consider the Capacitated Economic Lot Size problem with piecewise linear production costs and general holding costs, which is an NP-hard problem but solvable in pseudo-polynomial time. A straightforward dynamic programming approach to this problem results in an [TeX: $O(n^2 \bar{c} \bar{d}...

One of the basic assumptions of the classical dynamic lot-sizing model is that the aggregate demand of a given period must be satisfied in that period. Under this assumption, if backlogging is not allowed then the demand of a given period cannot be delivered earlier or later than the period. If...

In this paper we propose a Branch and Price algorithm for solving multi-period single-sourcing problems. In particular, we generalize a Branch and Price algorithm that was developed for the Generalized Assignment Problem (GAP) to a class of convex assignment problems. We then identify an...

We study a class of scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature which consist of a sorting step to determine an optimal job sequence, followed by a dynamic programming step...

Vehicle scheduling is the process of assigning vehicles to a set of predetermined trips with fixed starting and ending times, while minimizing capital and operating costs. This paper considers the polynomially solvable case in which there is a single depot and one type of vehicle. Several...

In this paper we study a model to estimate the probability that a target group of an advertising campaign is reached by a commercial message a given number of times. This contact frequency distribution is known to be computationally difficult to calculate because of dependence between the...