The purpose of this article is to evaluate the value of integrating tactical warehouse and inventory decisions. Therefore, a global warehouse and inventory model is presented and solved. In order to solve this mathematical model, two solution methodologies are developed which offer different...

In this paper, we present a mathematical model which integrates tactical-operational production and distribution decisions in a shared resources environment. More precisely, we integrate lot sizing production and distribution decisions with vehicle routing decisions. We obtain a global...

Three regions arising as surrogates in certain network design problems are the knapsack set X = {x [ belong ] [Z^n_+] : [ sum^n_j=1] C_jx_j ≥ b}, the simple capacitated flow set Y = {(y, x) [belong ] [R^1_+] x [Z^n_+] : y ≤ b,y ≤ [ sum^n_j=1] C_jx_j} and the set Z = {(y, x) [ belong ]...

In this paper we give a "personal" survey of the research on the polyhedral approach to lot-sizing problems developed over the last ten years. Most results concern the formulation and reformulations of single-item problems which can be used to tighten the formulation of practical multi-item and...

Much progress has been made in recent years in solving certain classes of production planning problems using mixed integer programming. One of the major challenges is how to make this expertise available and easy to use to the non-specialist and to the practitioners. Here we describe a modeling...