Predictive Search for Capacitated Multi-Item Lot Sizing Problems
From MaRDI portal
Publication:5084658
DOI10.1287/ijoc.2021.1073zbMath1492.90016OpenAlexW3195823016MaRDI QIDQ5084658
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
optimizationmixed integer programmingproduction planninglogistic regressionmachine learninglot sizingadvanced analytics
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
- A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging
- Relaxations for two-level multi-item lot-sizing problems
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
- Lagrangean relaxation based heuristics for lot sizing with setup times
- A heuristic approach for big bucket multi-level production planning problems
- Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight
- A hybrid optimization approach for multi-level capacitated lot-sizing problems
- A cutting plane approach to capacitated lot-sizing with start-up costs
- Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing
- A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
- Single item lot-sizing problems with backlogging on a single machine at a finite production rate
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
- Random effects logistic regression model for default prediction of technology credit guarantee fund
- An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
- An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs
- 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
- 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
- Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- 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
- 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
- The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Deterministic Production Planning: Algorithms and Complexity
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- Adaptive partitioned random search to global optimization
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- Nested Partitions Method for Global Optimization
- Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines
