Strong Formulations for Multi-Item Capacitated Lot Sizing

DOI10.1287/MNSC.30.10.1255zbMATH Open0601.90037OpenAlexW2019590415MaRDI QIDQ3737151FDOQ3737151

Tony J. van Roy, Imre Bárány, Laurence A. Wolsey

Publication date: 1984

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4605ecdbb28061aa5751f2d2504eb501e0c9a3bb

Recommendations

• Facets and algorithms for capacitated lot sizing
• scientific article; zbMATH DE number 780785
• Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups
• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• The application of valid inequalities to the multi-stage lot-sizing problem

zbMATH Keywords

valid inequalitiescutting plane algorithmComputational resultsMulti-item capacitated lot-sizing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)

Cited In (92)

• Lot-sizing on a tree
• A branch-and-cut algorithm for vehicle routing problems
• Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company
• Multi-item dynamic production-distribution planning in process industries with divergent finishing stages
• Primal-dual approach to the single level capacitated lot-sizing problem
• A column generation-based heuristic algorithm for an inventory routing problem with perishable goods
• Valid inequalities and separation for uncapacitated fixed charge networks
• Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations
• Valid inequalities and separation for capacitated fixed charge flow problems
• Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
• Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
• Box-constrained quadratic programs with fixed charge variables
• A cutting plane approach to capacitated lot-sizing with start-up costs
• A computational analysis of lower bounds for big bucket production planning problems
• Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight
• Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
• Integrated inventory model for similar products under a two-echelon supply chain environment: an empirical study
• Heuristic genetic algorithms for general capacitated lot-sizing problems
• Title not available (Why is that?)
• Single machine multi-product capacitated lot sizing with sequence-dependent setups
• Solving mixed integer programming production planning problems with setups by shadow price information.
• The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
• A linear description of the discrete lot-sizing and scheduling problem
• Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
• Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
• A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment
• Set partitioning and column generation heuristics for capacitated dynamic lotsizing
• A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
• A new dynamic programming algorithm for the single item capacitated dynamic lot size model
• The discrete lot-sizing and scheduling problem
• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• Lot sizing and scheduling -- survey and extensions
• Coordination of production and distribution planning
• Projections of the capacitated network loading problem
• Valid inequalities and separation for capacitated economic lot sizing
• A Benders decomposition based heuristic for the hierarchical production planning problem
• A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
• Multi-product valid inequalities for the discrete lot-sizing and scheduling problem
• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• Valid inequalities and facets of the capacitated plant location problem
• Capacitated replenishment and disposal planning for multiple products with resalable returns
• Modelling piecewise linear concave costs in a tree partitioning problem
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Capacitated lot-sizing and scheduling by Lagrangean relaxation
• Integrated production/distribution planning in supply chains: An invited review
• On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
• Valid inequalities for mixed 0-1 programs
• Lot-size models with backlogging: Strong reformulations and cutting planes
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• A heuristic approach for big bucket multi-level production planning problems
• Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
• Multi-item capacitated lot-sizing by a cross decomposition based algorithm
• Cutting planes in integer and mixed integer programming
• A simple heuristic for the multi-item single level capacitated lotsizing problem
• A new heuristic approach for the multi-item dynamic lot sizing problem
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
• Sequential pairing of mixed integer inequalities
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
• Single item lot sizing problems
• The application of valid inequalities to the multi-stage lot-sizing problem
• An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem
• Progress with single-item lot-sizing
• Facets and algorithms for capacitated lot sizing
• Multi-stage simultaneous lot-sizing and scheduling for flow line production
• Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
• Classical cuts for mixed-integer programming and branch-and-cut
• Strong formulations for mixed integer programming: A survey
• The multi-item capacitated lot-sizing problem with setup times and shortage costs
• An integrated model for inventory and production planning in a two-stage hybrid production system
• Predictive Search for Capacitated Multi-Item Lot Sizing Problems
• Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty
• Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups
• Two mixed integer programming formulations arising in manufacturing management
• Learning optimal solutions via an LSTM-optimization framework
• Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
• Robust formulations for economic lot-sizing problem with remanufacturing
• Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems
• COAL: A new heuristic approach for solving the fixed charge problem - computational results
• A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem
• Partial objective inequalities for the multi-item capacitated lot-sizing problem
• Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover
• Global optimality conditions for fixed charge quadratic programs
• Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
• Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem
• Worst case analysis of relax and fix heuristics for lot-sizing problems
• Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
• A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs
• The item dependent stockingcost constraint

This page was built for publication: Strong Formulations for Multi-Item Capacitated Lot Sizing

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