ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

재고 경로 문제 (Inventory Routing Problem, IRP)×자재 소요량 계획×
분야운영관리운영관리
계열Machine learningMachine learning
기원 연도20141975
창시자Coelho, L. C., Cordeau, J. F., & Laporte, G.Joseph Orlicky
유형Optimization problemMaterial planning algorithm
원전Coelho, L. C., Cordeau, J. F., & Laporte, G. (2014). Thirty years of inventory routing. Transportation Research Part B: Methodological, 55, 28-67. DOI ↗Orlicky, J. (1975). Material requirements planning: The new way of life in production and inventory management. New York: McGraw-Hill. link ↗
별칭IRP, vendor-managed logisticsMRP, MRP I
관련55
요약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.
ScholarGate데이터셋
  1. v1
  2. 2 출처
  3. PUBLISHED
  1. v1
  2. 2 출처
  3. PUBLISHED

검색으로 이동 슬라이드 다운로드

ScholarGate방법 비교: Inventory Routing · Material Requirements Planning. 2026-06-20에 다음에서 검색함: https://scholargate.app/ko/compare