In this paper we present a heuristic method, based on Lagrangian relaxation, for multilevel lot-sizing when there is a single bottleneck facility. A series of Lagrangian relaxations (one for each item in the product structure) is imbedded in a branch and bound procedure. The objective is to find...

This paper deals with the classical dynamic lot size problem without backlogging and capacity limitation. We derive worst case performance bounds for a class of lot sizing heuristics. When the considered methods are applied a decision whether to have a set-up or not in a certain period is taken...

We consider the optimal allocation of a resource in a single-facility production environment in the presence of capacity-based economies and diseconomies of scope. This setting generalizes the usual approach to single-facility resource allocation by allowing for the effective capacity of a...