Computational complexity of uncapacitated multi-echelon production planning problems
From MaRDI portal
Publication:1121774
DOI10.1016/0167-6377(89)90001-1zbMath0674.90044MaRDI QIDQ1121774
Dev Joneja, Robin Roundy, Esther M. Arkin
Publication date: 1989
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(89)90001-1
computational complexity; production planning; NP-complete; assembly system; Polynomial time algorithms; joint replenishment system; multi-echelon production-distribution systems
68Q25: Analysis of algorithms and problem complexity
90B35: Deterministic scheduling theory in operations research
90B30: Production models
Related Items
Models and algorithms for the dynamic-demand joint replenishment problem, Online Algorithms for Multilevel Aggregation, Single‐warehouse multi‐retailer inventory systems with full truckload shipments, The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard, The joint replenishment problem involving multiple suppliers offering quantity discounts, Decentralized supply chain coordination through auction markets: dynamic lot-sizing in distribution networks, New search algorithm for solving the maintenance scheduling problem for a family of machines, Supply Chain Management with Online Customer Selection, On reformulations for the one-warehouse multi-retailer problem, The submodular joint replenishment problem, Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales, Approximation algorithms for inventory problems with submodular or routing costs, Relaxations for two-level multi-item lot-sizing problems, Approximation algorithms for supply chain planning and logistics problems with market choice, Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory, Approximation algorithms for the joint replenishment problem with deadlines, A survey of lower bounding methodologies for production/inventory models, A genetic algorithm for joint replenishment based on the exact inventory cost, A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand, Decentralized multi-level uncapacitated lot-sizing by automated negotiation, Uncapacitated two-level lot-sizing, On the coordination of maintenance scheduling for transportation fleets of many branches of a logistic service provider, Efficient and effective heuristics for the coordinated capacitated lot-size problem, The coordinated replenishment dynamic lot-sizing problem with quantity discounts, Lot sizing and scheduling -- survey and extensions, Scheduling multimodal transportation systems., Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem, Distribution-free approach for stochastic joint-replenishment problem with backorders-lost sales mixtures, and controllable major ordering cost and lead times, Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem, Single-item dynamic lot-sizing problems: an updated survey, The dynamic-demand joint replenishment problem with approximated transportation costs, Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem, MIP formulations and heuristics for two-level production-transportation problems, The one-warehouse multi-retailer problem: reformulation, classification, and computational results, Multi-product lot-sizing with a transportation capacity reservation contract, An extension of the stochastic joint-replenishment problem under the class of cyclic policies, A global optimum search algorithm for the joint replenishment problem under power-of-two policy., Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost, A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems, A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure, A stochastic multi-item replenishment and delivery problem with lead-time reduction initiatives and the solving methodologies, Modeling and optimization of stochastic joint replenishment and delivery scheduling problem with uncertain costs, Statistical search methods for lotsizing problems, A review of the joint replenishment problem literature: 1989--2005, The joint replenishment problem with resource restriction, A supplier-selection model with classification and joint replenishment of inventory items, Integrating facility location and production planning decisions, The one-warehouse multiretailer problem with an order-up-to level inventory policy, APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES, A MODIFIED JOINT INVENTORY POLICY FOR VMI SYSTEMS, Unnamed Item
Cites Work
- Unnamed Item
- Dynamic Version of the Economic Lot Size Model
- Deterministic Production Planning: Algorithms and Complexity
- Computational Complexity of the Capacitated Lot Size Problem
- A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs
- A Deterministic Multiproduct, Multi-Facility Production and Inventory Model
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
- A Facilities in Series Inventory Model with Nested Schedules
- A Simple Continuous Review Deterministic One-Warehouse N-Retailer Inventory Problem
