Compară metode

	Problema de Rutare a Stocurilor (IRP)	Planificarea Cerințelor de Materiale
Domeniu	Managementul operațiunilor	Managementul operațiunilor
Familie	Machine learning	Machine learning
Anul apariției	2014	1975
Autorul original	Coelho, L. C., Cordeau, J. F., & Laporte, G.	Joseph Orlicky
Tip	Optimization problem	Material planning algorithm
Sursa seminală	Coelho, L. C., Cordeau, J. F., & Laporte, G. (2014). Thirty years of inventory routing. Transportation Research Part B: Methodological, 55, 28-67.	Orlicky, J. (1975). Material requirements planning: The new way of life in production and inventory management. New York: McGraw-Hill.
Denumiri alternative	IRP, vendor-managed logistics	MRP, MRP I
Înrudite	5	5
Rezumat	The Inventory Routing Problem (IRP) is an optimization problem that jointly determines inventory levels at customer locations, delivery routes, and shipment quantities to minimize total logistics and inventory holding costs. Rather than treating inventory management and vehicle routing as separate decisions, IRP recognizes that they are interdependent: larger shipments reduce routing costs but increase inventory holding costs, and vice versa. IRP is solved using mixed-integer programming, heuristics, and metaheuristics, and is a cornerstone of vendor-managed inventory (VMI) programs.	Material Requirements Planning (MRP) is a computerized system developed by Joseph Orlicky in the 1970s that calculates material requirements based on master production schedules and bill-of-materials data. MRP determines what materials to buy, how much to order, and when to order them to meet production demand while minimizing inventory carrying costs. It became a foundational technology for manufacturing planning and later evolved into manufacturing resource planning (MRP II) and enterprise resource planning (ERP) systems.