Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
From MaRDI portal
Publication:1737490
DOI10.1016/j.ejor.2019.03.001zbMath1430.90040OpenAlexW2921489307WikidataQ128246305 ScholiaQ128246305MaRDI QIDQ1737490
Tao Wu, Mingyao Qi, Canrong Zhang, Mingyuan Wei
Publication date: 23 April 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.03.001
Related Items (6)
A supervised learning-driven heuristic for solving the facility location and production planning problem ⋮ Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution ⋮ Dantzig-Wolfe decomposition for the facility location and production planning problem ⋮ Integrated lot sizing and blending problems ⋮ Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover ⋮ Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure
Uses Software
Cites Work
- A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry
- A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
- A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging
- Using and extending fix-and-relax to solve maritime inventory routing problems
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- Multi-level single machine lot-sizing and scheduling with zero lead times
- On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
- Single-point stochastic search algorithms for the multi-level lot-sizing problem
- RENS. The optimal rounding
- On a fix-and-relax framework for a class of project scheduling problems
- A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
- A heuristic approach for big bucket multi-level production planning problems
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures
- Some transformation techniques with applications in global optimization
- A hybrid optimization approach for multi-level capacitated lot-sizing problems
- Lot-size models with backlogging: Strong reformulations and cutting planes
- A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- On the polyhedral structure of a multi-item production planning model with setup times
- Replacement decisions with multiple stochastic values and depreciation
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A computational analysis of lower bounds for big bucket production planning problems
- Multi-stage simultaneous lot-sizing and scheduling for flow line production
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- Pricing, relaxing and fixing under lot sizing and scheduling
- Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms
- The multi-item capacitated lot-sizing problem with setup times and shortage costs
- Fix and relax heuristic for a stochastic lot-sizing problem
- The feasibility pump
- Lead time considerations for the multi-level capacitated lot-sizing problem
- A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
- Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
- The Capacitated Lot-Sizing Problem with Linked Lot Sizes
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- Combining population-based and exact methods for multi-level capacitated lot-sizing problems
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over
- Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Deterministic Production Planning: Algorithms and Complexity
- Production Planning by Mixed Integer Programming
This page was built for publication: Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
