Computational complexity of uncapacitated multi-echelon production planning problems
From MaRDI portal
Recommendations
- On the computational complexity of uncapacitated multi-plant lot-sizing problems
- Computational study of the multiechelon production planning problem
- An optimal algorithm for the multi-item capacitated production planning problem
- A polynomial algorithm for a multi-item capacitated production planning problem
- Multiechelon Lot Sizing: New Complexities and Inequalities
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Deterministic Multiproduct, Multi-Facility Production and Inventory Model
- A Facilities in Series Inventory Model with Nested Schedules
- A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs
- A Simple Continuous Review Deterministic One-Warehouse N-Retailer Inventory Problem
- Computational Complexity of the Capacitated Lot Size Problem
- Deterministic Production Planning: Algorithms and Complexity
- Dynamic version of the economic lot size model
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
Cited in
(72)- A heuristic algorithm to solve the one‐warehouse multiretailer problem with an emission constraint
- Improved approximation for the capacitated inventory access point problem
- An online joint replenishment problem combined with single machine scheduling
- Improved approximation algorithms for inventory problems
- Scheduling the repair and replacement of individual components in operating systems: a bi-objective mathematical optimization model
- Joint replenishment meets scheduling
- A multivariate complexity analysis of the material consumption scheduling problem
- The periodic joint replenishment problem is strongly \(\mathcal{NP} \)-hard
- Simultaneous scheduling of replacement and repair of common components in operating systems. A multi-objective mathematical optimization model
- On the coordination of maintenance scheduling for transportation fleets of many branches of a logistic service provider
- Multi-period lot-sizing with supplier selection: structural results, complexity and algorithms
- On reformulations for the one-warehouse multi-retailer problem
- The dynamic-demand joint replenishment problem with approximated transportation costs
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
- A survey of lower bounding methodologies for production/inventory models
- On the computational complexity of uncapacitated multi-plant lot-sizing problems
- Complexity of inventory routing problems when routing is easy
- Scheduling multimodal transportation systems.
- Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection
- Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem
- Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution
- The coordinated replenishment dynamic lot-sizing problem with quantity discounts
- Multi-product lot-sizing with a transportation capacity reservation contract
- Uncapacitated two-level lot-sizing
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
- A supplier-selection model with classification and joint replenishment of inventory items
- Relaxations for two-level multi-item lot-sizing problems
- Single-warehouse multi-retailer inventory systems with full truckload shipments
- Modeling and optimization of stochastic joint replenishment and delivery scheduling problem with uncertain costs
- Supply chain management with online customer selection
- Distribution-free approach for stochastic joint-replenishment problem with backorders-lost sales mixtures, and controllable major ordering cost and lead times
- Multiindex optimal production planning problems
- A genetic algorithm for joint replenishment based on the exact inventory cost
- New search algorithm for solving the maintenance scheduling problem for a family of machines
- Statistical search methods for lotsizing problems
- A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure
- Combinatorial heuristics for inventory routing problems
- A stochastic multi-item replenishment and delivery problem with lead-time reduction initiatives and the solving methodologies
- The joint replenishment problem with resource restriction
- A review of the joint replenishment problem literature: 1989--2005
- Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost
- Integrating facility location and production planning decisions
- Lot sizing and scheduling -- survey and extensions
- scientific article; zbMATH DE number 1342809 (Why is no real title available?)
- Efficient and effective heuristics for the coordinated capacitated lot-size problem
- The submodular joint replenishment problem
- Controlling lead times and minor ordering costs in the joint replenishment problem with stochastic demands under the class of cyclic policies
- On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4]
- Single-item dynamic lot-sizing problems: an updated survey
- NP-hardness proof for the assembly problem with stationary setup and additive holding costs
- Online Algorithms for Multilevel Aggregation
- Decentralized supply chain coordination through auction markets: dynamic lot-sizing in distribution networks
- The one-warehouse multiretailer problem with an order-up-to level inventory policy
- Approximation algorithms for supply chain planning and logistics problems with market choice
- Terminal inventory level constraints for online production scheduling
- A periodic review policy for a coordinated single vendor-multiple buyers supply chain with controllable lead time and distribution-free approach
- Models and algorithms for the dynamic-demand joint replenishment problem
- <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs
- Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales
- A MODIFIED JOINT INVENTORY POLICY FOR VMI SYSTEMS
- A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand
- An extension of the stochastic joint-replenishment problem under the class of cyclic policies
- Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem
- Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem
- The joint replenishment problem involving multiple suppliers offering quantity discounts
- MIP formulations and heuristics for two-level production-transportation problems
- The one-warehouse multi-retailer problem: reformulation, classification, and computational results
- Approximation algorithms for inventory problems with submodular or routing costs
- Decentralized multi-level uncapacitated lot-sizing by automated negotiation
- APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES
- A global optimum search algorithm for the joint replenishment problem under power-of-two policy.
- New results on multi-level aggregation
This page was built for publication: Computational complexity of uncapacitated multi-echelon production planning problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121774)
