A cutting plane approach to capacitated lot-sizing with start-up costs
From MaRDI portal
Publication:1363415
DOI10.1007/BF02592189zbMath0874.90098OpenAlexW2107396523MaRDI QIDQ1363415
Publication date: 11 November 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02592189
valid inequalitiescapacitated lot-sizingmixed integer modelcutting plane/branch and boundmulti-item single machine production planning
Related Items
A polyhedral study of production ramping ⋮ A cross entropy algorithm for the Knapsack problem with setups ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Partial objective inequalities for the multi-item capacitated lot-sizing problem ⋮ On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ Progress with single-item lot-sizing ⋮ A computational analysis of lower bounds for big bucket production planning problems ⋮ Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems ⋮ LS-LIB: A Library of Tools for Solving Production Planning Problems ⋮ A polyhedral study of lot-sizing with supplier selection ⋮ An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand ⋮ A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times ⋮ A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing ⋮ A heuristic approach for big bucket multi-level production planning problems ⋮ Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution ⋮ Cutting planes in integer and mixed integer programming ⋮ The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times ⋮ Multi-item dynamic production-distribution planning in process industries with divergent finishing stages ⋮ A maritime inventory routing problem: Discrete time formulations and valid inequalities ⋮ MIP modelling of changeovers in production planning and scheduling problems ⋮ A polyhedral study of the single-item lot-sizing problem with continuous start-up costs ⋮ On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra ⋮ Optimal planning in large multi-site production networks ⋮ The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity ⋮ On a fix-and-relax framework for a class of project scheduling problems
Cites Work
- Valid inequalities and separation for capacitated economic lot sizing
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Facets and algorithms for capacitated lot sizing
- Uncapacitated lot-sizing: The convex hull of solutions
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- Uncapacitated Lot-Sizing Problems with Start-Up Costs
- A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
- The Deterministic Dynamic Product Cycling Problem
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
