Efficient and effective heuristics for the coordinated capacitated lot-size problem
From MaRDI portal
Publication:1046059
DOI10.1016/j.ejor.2009.08.015zbMath1177.90220OpenAlexW2167190645MaRDI QIDQ1046059
Arunachalam Narayanan, Powell E. jun. Robinson
Publication date: 21 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.08.015
Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
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 ⋮ Controlling lead times and minor ordering costs in the joint replenishment problem with stochastic demands under the class of cyclic policies ⋮ An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Computational complexity of uncapacitated multi-echelon production planning problems
- On the optimality of joint ordering policies in a multi-product dynamic lot size model with individual and joint set-up costs
- Lot sizing and scheduling -- survey and extensions
- Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- The Joint Replenishment Problem: New Heuristics and Worst Case Performance Bounds
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- Multiproduct dynamic lot-sizing model with coordinated replenishments
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
- Heuristic Methods for the Multi-product Dynamic Lot Size Problem
- A Multi-Product Dynamic Lot-Size Model with Individual and Joint Set-up Costs
- Coordinated replenishments of items under time-varying demand: Dynamic programming formulation
- A Dual Ascent Procedure for Multiproduct Dynamic Demand Coordinated Replenishment with Backlogging
- Models and algorithms for the dynamic-demand joint replenishment problem
- The Joint Replenishment Problem with Time-Varying Costs and Demands: Efficient, Asymptotic and ε-Optimal Solutions
- A primal-dual algorithm for the dynamic lotsizing problem with joint set-up costs
- Modeling industrial lot sizing problems: a review
- Effective heuristics for the dynamic demand joint replenishment problem
- Production Planning by Mixed Integer Programming
- A Deterministic Multiproduct, Multi-Facility Production and Inventory Model
- Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
