A Study on Multiple Product Dynamic Lot-sizing
نویسندگان
چکیده
منابع مشابه
Lot-sizing on a tree
For the problem of lot-sizing on a tree with constant capacities, or stochastic lot-sizing with a scenario tree, we present various reformulations based on mixing sets. We also show how earlier results for uncapacitated problems involving (Q,SQ) inequalities can be simplified and extended. Finally some limited computational results are presented.
متن کاملMulti-product lot-sizing and scheduling on unrelated parallel machines
We study a problem of optimal scheduling and lot-sizing a number of products on m unrelated parallel machines to satisfy given demands. A sequence dependent setup time is required between lots of different products. The products are assumed to be all continuously divisible or all discrete. The criterion is to minimize the time, at which all the demands are satisfied, Cmax, or the maximum latene...
متن کاملDynamic knapsack sets and capacitated lot-sizing
A dynamic knapsack set is a natural generalization of the 0-1 knapsack set with a continuous variable studied recently. For dynamic knapsack sets a large family of facet-defining inequalities, called dynamic knapsack inequalities, are derived by fixing variables to one and then lifting. Surprisingly such inequalities have the simultaneous lifting property, and for small instances provide a sign...
متن کاملSome New Dynamic Economic Lot Sizing Models
We introduce a dynamic economic lot sizing problem whose production cost considers both setup and the designed-and-yet stretchable production capacity. Demands and the control on production activities drive the evolution of the production system. We give a pseudo-polynomial algorithm for the problem when future demands are known. When there is uncertainty in future demands and there is no holdi...
متن کاملA study of the lot-sizing polytope
The lot–sizing polytope is a fundamental structure contained in many practical production planning problems. Here we study this polytope and identify facet–defining inequalities that cut off all fractional extreme points of its linear programming relaxation, as well as liftings from those facets. We give a polynomial– time combinatorial separation algorithm for the inequalities when capacities ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Academia-Industrial cooperation Society
سال: 2012
ISSN: 1975-4701
DOI: 10.5762/kais.2012.13.7.2955