A model for optimizing multi-product inventory systems with multiple constraints
| Autor: | Cengiz Haksever, John Moussourakis |
|---|---|
| Rok vydání: | 2005 |
| Předmět: |
Economics and Econometrics
Mathematical optimization Operations research Computer science Total cost Inventory theory Management Science and Operations Research Cycle count General Business Management and Accounting Constraint (mathematics) Industrial and Manufacturing Engineering Task (project management) |
| Zdroj: | International Journal of Production Economics. 97:18-30 |
| ISSN: | 0925-5273 |
| DOI: | 10.1016/j.ijpe.2004.05.004 |
| Popis: | “How much to order” and “when to order” are the two fundamental issues managers have to resolve in an inventory system. Making these decisions in inventory systems with multiple products is a challenging task for managers because these decisions are often subject to several constraints due to limited resources such as budget, space, and the maximum weight of goods that can be stored. Most approaches in the literature for optimizing decisions in such an environment consider only a single budgetary constraint. This paper presents a mixed-integer programming model to optimize the two fundamental decisions of inventory management for ordering multiple inventory items subject to multiple resource constraints. It also determines whether a fixed cycle for all products or an independent cycle for each should be used for a lower total cost. The solution of the model does not seem to require excessive central processing unit (cpu) time as indicated by the computational experience reported in this paper; solution of the largest test problem, with 30 products and five resource constraints, required less than 20 cpu seconds on a personal computer. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect