The textbook Dantzig-Wolfe decomposition for the Capacitated Lot Sizing Problem (CLSP),as already proposed by Manne in 1958, has an important structural deficiency. Imposingintegrality constraints on the variables in the full blown master will not necessarily give theoptimal IP solution as only...

In this paper we give an overview of recent developments in the field of modeling single-level dynamic lot sizing problems. The focus of this paper is on the modeling various industrial extensions and not on the solution approaches. The timeliness of such a review stems from the growing industry...

In this paper we elaborate on a Total Cost of Ownership supplier selection methodology that we have constructed using real life case studies of three different industrial components groups in a firm. These case studies are presented in this article. Analysing the value chain of the firm, data on...

Proofs from complexity theory as well as computational experiments indicate that most lot sizing problems are hard to solve. Because these problems are so difficult, various solution techniques have been proposed to solve them. In the past decade, meta-heuristics such as tabu search, genetic...

We present new lower bounds for the Capacitated Lot Sizing Problem with Set Up Times. We improve the lower bound obtained by the textbook Dantzig-Wolfe decomposition where the capacity constraints are the linking constraints. In our approach, Dantzig-Wolfe decomposition is applied to the network...

An inherent characteristic of Ramp;D projects is technological uncertainty, which may result in project failure, and time and resources spent without any tangible return. In pharmaceutical projects, for instance, stringent scientific procedures have to be followed to ensure patient safety and...