Порівняння методів

	Сукупне планування	Ефект батога	Проблема маршрутизації запасів
Галузь	Операційний менеджмент	Операційний менеджмент	Операційний менеджмент
Родина	Machine learning	Machine learning	Machine learning
Рік появи	1992	1961	2014
Автор методу	Wallace, T. F.	Jay Forrester	Coelho, L. C., Cordeau, J. F., & Laporte, G.
Тип	Demand-supply planning framework	Phenomenon and analysis framework	Optimization problem
Основоположне джерело	Wallace, T. F. (1992). Sales & Operations Planning: The how-to handbook. Cincinnati: APICS Publications.	Lee, H. L., Padmanabhan, V., & Whang, S. (1997). The bullwhip effect in supply chains. Sloan Management Review, 38(3), 93–102.	Coelho, L. C., Cordeau, J. F., & Laporte, G. (2014). Thirty years of inventory routing. Transportation Research Part B: Methodological, 55, 28-67.
Інші назви	sales and operations planning, production planning	demand amplification, Forrester effect	IRP, vendor-managed logistics
Пов'язані	5	5	5
Підсумок	Aggregate Planning (or Sales & Operations Planning, S&OP) is a collaborative, iterative process that balances demand and supply at a high level—typically grouping products into families and planning over a 3–18 month horizon. Developed formally by Tom Wallace and popularized through APICS, aggregate planning helps organizations align sales forecasts, production capacity, inventory, and workforce to meet demand efficiently while managing costs. It serves as the bridge between strategic business plans and detailed operational execution.	The Bullwhip Effect is a phenomenon in supply chain management where small fluctuations in end-customer demand cause progressively larger fluctuations in orders as one moves upstream from retail to distributors to manufacturers to suppliers. First formally documented by Jay Forrester in his 1961 system dynamics work, and later popularized by Lee, Padmanabhan, and Whang in 1997, the effect reveals how information delays and ordering strategies amplify demand variability throughout supply chains, leading to excess inventory, inefficient production scheduling, and increased costs.	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.