We propose a tactical model which integrates the replenishment decision in inventorymanagement, the allocation of products to warehousing systems and the assignment of products tostorage locations in warehousing management. The purpose of this article is to analyse the valueof integrating...

We consider the single item lot-sizing problem with capacities that are non-decreasing overtime. When the cost function is i) non-speculative or Wagner-Whitin (for instance, constantunit production costs and non-negative unit holding costs), and ii) the production set-upcosts are non-increasing...

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...

Providing a good formulation is an important part of solving a mixed integer program. We suggest to measure the quality of a formulation by whether it is possible to strengthen the coefficients of the formulation. Sequentially strengthening coefficients can then be used as a tool for improving...

We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, constant unit production costs and non-negative unit holding costs), and ii) the production set-up costs are...

We examine a variant of the uncapacitated lot-sizing model of Wagner-Whitin involving sales instead of fixed demands, and lower bounds on stocks. Two extended formulations are presented, as well as a dynamic programming algorithm and a complete description of the convex hull of solutions. When...

Mixed-integer rounding (MIR) inequalities play a central role in the development of strong cutting planes for mixed-integer programs. In this paper, we investigate how known MIR inequalities can be combined in order to generate new strong valid inequalities. Given a mixed-integer region S and a...

We consider the problem of designing a 2-stations Automated GuidedVehicle System (AGVS). The AGV System consists of a pool of vehicles that transports products from one station to the other station through an unidirectional guidepath. We seek a model to estimate the minimal number of vehicles...