In this paper we discuss a real-life case study in the optimization of the logistics network for the collection of containers from end-of-life vehicle dismantlers in the Netherlands.Advanced planning concepts like dynamic assignment of dismantlers to logistic service providers are analyzed by a...

This paper generalizes Porter’s notion of the value chain for the analysis of service industries. The generalization entails that the flow and the physical transformation and assembly of goods that are characteristic of manufacturing are generalized into flows and transformation of data and...

Short-term performance of a production management system for make-to-stock factories may be quantified through the service rate per shift; long-term performance through the average monthly work in process (WIP). This may yield, for example, that WIP is minimized, while the probability of the...

This paper addresses a highly challenging scheduling problem in the field of printed circuit board (PCB) assembly systems using Surface Mounting Devices (SMD). After describing some challenging optimization sub-problems relating to the heads of multi-head surface mounting placement machines, we...

We introduce an accurate, easily implementable, and fast algorithm to compute optimal decisions in discrete-time long-horizon welfaremaximizing problems. The algorithm is useful when interest is only in the decisions up to period T, where T is small. It relies on a flexible parametrization of...

Finding the lexicographic maximum of a polytope in Rn can be achieved by solving a suitable LP-problem.

In this paper we consider the linear quadratic differential game for descriptor systems that have index one. We derive both necessary and sufficient conditions for existence of an open-loop Nash equilibrium.

This paper adresses the robust counterparts of optimization problems containing sums of maxima of linear functions and proposes several reformulations. These problems include many practical problems, e.g. problems with sums of absolute values, and arise when taking the robust counterpart of a...

We consider semidefinite programming relaxations of the quadratic assignment problem, and show how to exploit group symmetry in the problem data. Thus we are able to compute the best known lower bounds for several instances of quadratic assignment problems from the problem library: [R.E....