A cutting plane approach to capacitated lot-sizing with start-up costs
From MaRDI portal
(Redirected from Publication:1363415)
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
Cites work
- A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
- Facets and algorithms for capacitated lot sizing
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Polyhedral Characterization of the Economic Lot-Sizing Problem with Start-Up Costs
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- The Deterministic Dynamic Product Cycling Problem
- Uncapacitated Lot-Sizing Problems with Start-Up Costs
- Uncapacitated lot-sizing: The convex hull of solutions
- Valid inequalities and separation for capacitated economic lot sizing
Cited in
(32)- Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
- A computational analysis of lower bounds for big bucket production planning problems
- On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay
- A maritime inventory routing problem: discrete time formulations and valid inequalities
- Progress with single-item lot-sizing
- A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
- A polyhedral study of production ramping
- A heuristic approach for big bucket multi-level production planning problems
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
- A cross entropy algorithm for the Knapsack problem with setups
- Valid inequalities and separation for capacitated economic lot sizing
- Partial objective inequalities for the multi-item capacitated lot-sizing problem
- Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
- The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
- An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand
- MIP modelling of changeovers in production planning and scheduling problems
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Multi-item dynamic production-distribution planning in process industries with divergent finishing stages
- On a fix-and-relax framework for a class of project scheduling problems
- The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity
- A polyhedral approach to a production planning problem
- Facets and algorithms for capacitated lot sizing
- Cutting planes in integer and mixed integer programming
- Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution
- Predictive search for capacitated multi-item lot sizing problems
- Valid Inequalities for the Lasdon-Terjung Production Model
- 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
- A polyhedral study of lot-sizing with supplier selection
- Optimal planning in large multi-site production networks
- LS-LIB: a library of tools for solving production planning problems
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)
