Lot-sizing algorithm for a coordinated multi-item, multi-source distribution problem

DOI10.1016/0377-2217(92)90196-GzbMath0768.90016OpenAlexW1967158274MaRDI QIDQ1198316

Paul Iyogun

Publication date: 16 January 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90196-g

zbMATH Keywords

lot sizingwarehousedistribution problemproduct-nested replenishment policyproduction facilities

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Production models (90B30) Inventory, storage, reservoirs (90B05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

Inventory Management: An Overview, Canadian Publications, Practical Applications and Suggestions for Future Research ⋮ Hierarchical design of an integrated production and 2-echelon distribution system

Cites Work

• A lower bound on a class of coordinated inventory/production problems
• Computing Nested Reorder Intervals for Multi-Item Distribution Systems
• 98%-Effective Integer-Ratio Lot-Sizing for One-Warehouse Multi-Retailer Systems
• Note—On the Deterministic Demand Multi-Product Single-Machine Lot Scheduling Problem
• Optimum Ordering Policy for a Multi Item Single Supplier System
• A 98%-Effective Lot-Sizing Rule for a Multi-Product, Multi-Stage Production / Inventory System

This page was built for publication: Lot-sizing algorithm for a coordinated multi-item, multi-source distribution problem