A cutting plane approach to capacitated lot-sizing with start-up costs

DOI10.1007/BF02592189zbMATH Open0874.90098OpenAlexW2107396523MaRDI QIDQ1363415FDOQ1363415

Authors: Miguel Constantino 

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

Recommendations

• A quick and effective method for capacitated lot sizing with startup and reservation costs
• Uncapacitated Lot-Sizing Problems with Start-Up Costs
• Efficient Solution of the Single-item, Capacitated Lot-sizing Problem with Start-up and Reservation Costs
• Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
• A polyhedral study of the single-item lot-sizing problem with continuous start-up costs
• The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity
• The Dynamic Lot-Sizing Problem with Startup and Reservation Costs
• Capacitated lot-sizing with sequence dependent setup costs
• The multi-item capacitated lot-sizing problem with setup times and shortage costs
• Models and methods for capacitated lot-sizing problems

zbMATH Keywords

valid inequalitiescapacitated lot-sizingmixed integer modelcutting plane/branch and boundmulti-item single machine production planning

Mathematics Subject Classification ID

Production models (90B30)

Cites Work

• Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
• Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
• Polyhedra for lot-sizing with Wagner-Whitin costs
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Facets and algorithms for capacitated lot sizing
• Uncapacitated lot-sizing: The convex hull of solutions
• Valid inequalities and separation for capacitated economic lot sizing
• The Deterministic Dynamic Product Cycling Problem
• Uncapacitated Lot-Sizing Problems with Start-Up Costs

Cited In (32)

• A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
• The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity
• A cross entropy algorithm for the Knapsack problem with setups
• A maritime inventory routing problem: discrete time formulations and valid inequalities
• Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
• Multi-item dynamic production-distribution planning in process industries with divergent finishing stages
• An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand
• LS-LIB: a library of tools for solving production planning problems
• A computational analysis of lower bounds for big bucket production planning problems
• A polyhedral study of production ramping
• Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models
• Predictive search for capacitated multi-item lot sizing problems
• A polyhedral study of lot-sizing with supplier selection
• On a fix-and-relax framework for a class of project scheduling problems
• Partial objective inequalities for the multi-item capacitated lot-sizing problem
• Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• MIP modelling of changeovers in production planning and scheduling problems
• Valid inequalities and separation for capacitated economic lot sizing
• A polyhedral study of the single-item lot-sizing problem with continuous start-up costs
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay
• A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
• A polyhedral approach to a production planning problem
• A heuristic approach for big bucket multi-level production planning problems
• Cutting planes in integer and mixed integer programming
• A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
• Valid Inequalities for the Lasdon-Terjung Production Model
• On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
• Optimal planning in large multi-site production networks
• Progress with single-item lot-sizing
• Facets and algorithms for capacitated lot sizing

This page was built for publication: A cutting plane approach to capacitated lot-sizing with start-up costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363415)