منابع مشابه
Two-level lot-sizing with inventory bounds
We study a two-level uncapacitated lot-sizing problem with inventory bounds that occurs in a supply chain composed of a supplier and a retailer. The first level with the demands is the retailer level and the second one is the supplier level. The aim is to minimize the cost of the supply chain so as to satisfy the demands when the quantity of item that can be held in inventory at each period is ...
متن کاملLot sizing with inventory gains
This paper introduces the single item lot sizing problem with inventory gains. This problem is a generalization of the classical single item capacitated lot sizing problem to one in which stock is not conserved. That is, the stock in inventory undergoes a transformation in each period that is independent of the period in which the item was produced. A 0 1 mixed integer programming formulation o...
متن کاملInventory lot-sizing with supplier selection
This paper presents a multi-period inventory lot-sizing scenario, where there are multiple products and multiple suppliers. We consider a situation where the demand of multiple discrete products is known over a planning horizon. Each of these products can be sourced from a set of approved suppliers, a supplier-dependent transaction cost applying for each period in which an order is placed on a ...
متن کاملMathematical Models and Lagrangian Heuristics for a Two-level Lot-sizing Problem with Bounded Inventory
ABSTRACT: We consider a two-level lot-sizing problem where the first level consists of N end products competing for a single type of raw material (second level), which is supposed to be critical. In particular, the storage capacity of raw materials is limited and must be carefully managed. The goal is to simultaneously determine an optimal replenishment plan for the raw material and optimal pro...
متن کاملLot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
We investigate the polyhedral structure of the lot-sizing problem with inventory bounds. We consider two models, one with linear cost on inventory, the other with linear and fixed costs on inventory. For both models, we identify facet-defining inequalities that make use of the inventory bounds explicitly and give exact separation algorithms. We also describe a linear programming formulation of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2018
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2018.05.001