A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
From MaRDI portal
Publication:3392124
DOI10.1287/opre.1070.0404zbMath1167.90321OpenAlexW2093412055MaRDI QIDQ3392124
Publication date: 13 August 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/582e8988a585115f51ae1f2169a8d1853fb4c604
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Inventory, storage, reservoirs (90B05)
Related Items
Column Generation based Primal Heuristics ⋮ Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups ⋮ Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ A branch-and-price algorithm for stable workforce assignments with hierarchical skills ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ The green capacitated multi-item lot sizing problem with parallel machines ⋮ Heuristics for the multi-item capacitated lot-sizing problem with lost sales ⋮ Integrated bin packing and lot-sizing problem considering the configuration-dependent bin packing process ⋮ A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times ⋮ Hybrid methods for lot sizing on parallel machines ⋮ Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems ⋮ Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ 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 ⋮ Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem ⋮ An integer programming column generation principle for heuristic search methods ⋮ A computational analysis of lower bounds for big bucket production planning problems ⋮ New construction heuristic for capacitated lot sizing problems ⋮ Just-in-Time Planning and Lot-Sizing ⋮ Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem ⋮ Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems ⋮ Joint optimisation of drone routing and battery wear for sustainable supply chain development: a mixed-integer programming model based on blockchain-enabled fleet sharing ⋮ Regenerator Location Problem in Flexible Optical Networks ⋮ A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times ⋮ Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines ⋮ Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing ⋮ Primal Heuristics for Branch and Price: The Assets of Diving Methods ⋮ Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system ⋮ Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines ⋮ A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing ⋮ Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case ⋮ A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems ⋮ A generic view of Dantzig--Wolfe decomposition in mixed integer programming ⋮ Multi-item capacitated lot-sizing problems with setup times and pricing decisions ⋮ Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs ⋮ Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times ⋮ Branch and Price for Chance-Constrained Bin Packing ⋮ A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times ⋮ Timed route approaches for large multi-product multi-step capacitated production planning problems
Uses Software
This page was built for publication: A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
