bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
From MaRDI portal
Publication:3116760
DOI10.1287/mnsc.46.5.724.12048zbMath1231.90384OpenAlexW2147628804MaRDI QIDQ3116760
Gaetan Belvaux, Laurence A. Wolsey
Publication date: 12 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.46.5.724.12048
Related Items
A supervised learning-driven heuristic for solving the facility location and production planning problem ⋮ Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ The green capacitated multi-item lot sizing problem with parallel machines ⋮ Partial objective inequalities for the multi-item capacitated lot-sizing problem ⋮ Heuristics for the multi-item capacitated lot-sizing problem with lost sales ⋮ Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms ⋮ Mathematical programming based heuristics for the 0--1 MIP: a survey ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ Matheuristics: survey and synthesis ⋮ A computational analysis of lower bounds for big bucket production planning problems ⋮ A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging ⋮ Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations ⋮ A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs ⋮ Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems ⋮ The profit maximizing capacitated lot-size (PCLSP) problem ⋮ A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines ⋮ LS-LIB: A Library of Tools for Solving Production Planning Problems ⋮ A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times ⋮ Improved lower bounds for the capacitated lot sizing problem with setup times. ⋮ The dynamic bowser routing problem ⋮ Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines ⋮ Capacitated lot-sizing with extensions: a review ⋮ Modeling industrial lot sizing problems: a review ⋮ Integrated production planning and preventive maintenance in deteriorating production systems ⋮ Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines ⋮ Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials ⋮ Manufacturer's mixed pallet design problem ⋮ The multi-item capacitated lot-sizing problem with setup times and shortage costs ⋮ A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing ⋮ A heuristic approach for big bucket multi-level production planning problems ⋮ Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case ⋮ An efficient matheuristic for offline patient-to-bed assignment problems ⋮ A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems ⋮ Perspectives on integer programming for time-dependent models ⋮ On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times ⋮ An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times ⋮ Stochastic lot-sizing with backlogging: computational complexity analysis ⋮ Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution ⋮ Cutting planes in integer and mixed integer programming ⋮ Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight ⋮ MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs ⋮ Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs ⋮ Workforce planning in a lotsizing mail processing problem ⋮ A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems ⋮ A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment ⋮ Worst case analysis of relax and fix heuristics for lot-sizing problems ⋮ A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times ⋮ Single item lot sizing problems ⋮ Efficient and effective heuristics for the coordinated capacitated lot-size problem ⋮ Approximate extended formulations ⋮ Heuristic genetic algorithms for general capacitated lot-sizing problems
Uses Software
