Pages that link to "Item:Q1121774"

The following pages link to Computational complexity of uncapacitated multi-echelon production planning problems (Q1121774):

Displaying 50 items.

• On reformulations for the one-warehouse multi-retailer problem (Q271926) (← links)
• The submodular joint replenishment problem (Q304238) (← links)
• Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales (Q322424) (← links)
• Approximation algorithms for inventory problems with submodular or routing costs (Q344939) (← links)
• Relaxations for two-level multi-item lot-sizing problems (Q403668) (← links)
• Multiindex optimal production planning problems (Q612224) (← links)
• Approximation algorithms for supply chain planning and logistics problems with market choice (Q647392) (← links)
• Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory (Q747754) (← links)
• On the computational complexity of uncapacitated multi-plant lot-sizing problems (Q828705) (← links)
• On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4] (Q860874) (← links)
• Approximation algorithms for the joint replenishment problem with deadlines (Q906550) (← links)
• A survey of lower bounding methodologies for production/inventory models (Q922260) (← links)
• A genetic algorithm for joint replenishment based on the exact inventory cost (Q947954) (← links)
• A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand (Q949496) (← links)
• Decentralized multi-level uncapacitated lot-sizing by automated negotiation (Q989827) (← links)
• Uncapacitated two-level lot-sizing (Q991455) (← links)
• On the coordination of maintenance scheduling for transportation fleets of many branches of a logistic service provider (Q1004810) (← links)
• Efficient and effective heuristics for the coordinated capacitated lot-size problem (Q1046059) (← links)
• The coordinated replenishment dynamic lot-sizing problem with quantity discounts (Q1278282) (← links)
• Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
• Scheduling multimodal transportation systems. (Q1427582) (← links)
• Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem (Q1631181) (← links)
• Distribution-free approach for stochastic joint-replenishment problem with backorders-lost sales mixtures, and controllable major ordering cost and lead times (Q1652163) (← links)
• Heuristics based on genetic algorithms for the capacitated multi vehicle production distribution problem (Q1652661) (← links)
• Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
• The dynamic-demand joint replenishment problem with approximated transportation costs (Q1734353) (← links)
• Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem (Q1734824) (← links)
• MIP formulations and heuristics for two-level production-transportation problems (Q1761227) (← links)
• The one-warehouse multi-retailer problem: reformulation, classification, and computational results (Q1761836) (← links)
• Multi-product lot-sizing with a transportation capacity reservation contract (Q1776959) (← links)
• An extension of the stochastic joint-replenishment problem under the class of cyclic policies (Q1785764) (← links)
• A global optimum search algorithm for the joint replenishment problem under power-of-two policy. (Q1868815) (← links)
• NP-hardness proof for the assembly problem with stationary setup and additive holding costs (Q1949675) (← links)
• New results on multi-level aggregation (Q1998855) (← links)
• Multi-period lot-sizing with supplier selection: structural results, complexity and algorithms (Q2060614) (← links)
• Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost (Q2201355) (← links)
• Terminal inventory level constraints for online production scheduling (Q2239846) (← links)
• A periodic review policy for a coordinated single vendor-multiple buyers supply chain with controllable lead time and distribution-free approach (Q2240673) (← links)
• A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems (Q2256206) (← links)
• A comparison of formulations for a three-level lot sizing and replenishment problem with a distribution structure (Q2273683) (← links)
• A stochastic multi-item replenishment and delivery problem with lead-time reduction initiatives and the solving methodologies (Q2294912) (← links)
• Modeling and optimization of stochastic joint replenishment and delivery scheduling problem with uncertain costs (Q2312249) (← links)
• Statistical search methods for lotsizing problems (Q2367017) (← links)
• A review of the joint replenishment problem literature: 1989--2005 (Q2462102) (← links)
• The joint replenishment problem with resource restriction (Q2491784) (← links)
• Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection (Q2668663) (← links)
• Improved approximation for the capacitated inventory access point problem (Q2670449) (← links)
• A supplier-selection model with classification and joint replenishment of inventory items (Q2798507) (← links)
• Integrating facility location and production planning decisions (Q3057133) (← links)
• The one-warehouse multiretailer problem with an order-up-to level inventory policy (Q3065627) (← links)