Predictive search for capacitated multi-item lot sizing problems
From MaRDI portal
Publication:5084658
DOI10.1287/IJOC.2021.1073zbMATH Open1492.90016OpenAlexW3195823016MaRDI QIDQ5084658FDOQ5084658
Publication date: 28 June 2022
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2021.1073
Recommendations
- Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines
- A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
- Combining population-based and exact methods for multi-level capacitated lot-sizing problems
- A hybrid optimization approach for multi-level capacitated lot-sizing problems
- A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
optimizationlogistic regressionmachine learningmixed integer programmingproduction planninglot sizingadvanced analytics
Cites Work
- Title not available (Why is that?)
- A cutting plane approach to capacitated lot-sizing with start-up costs
- Adaptive partitioned random search to global optimization
- Nested Partitions Method for Global Optimization
- Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- Deterministic Production Planning: Algorithms and Complexity
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Title not available (Why is that?)
- A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
- An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem
- Relaxations for two-level multi-item lot-sizing problems
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- Lagrangean relaxation based heuristics for lot sizing with setup times
- A hybrid optimization approach for multi-level capacitated lot-sizing problems
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Title not available (Why is that?)
- A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- 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
- Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- A heuristic approach for big bucket multi-level production planning problems
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Single item lot-sizing problems with backlogging on a single machine at a finite production rate
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
- Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
- An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
- Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
- Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing
- An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
- A horizon decomposition approach for the capacitated lot-sizing problem with setup times
- Random effects logistic regression model for default prediction of technology credit guarantee fund
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
- Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines
- Title not available (Why is that?)
Cited In (1)
Uses Software
This page was built for publication: Predictive search for capacitated multi-item lot sizing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084658)
