Strong Formulations for Multi-Item Capacitated Lot Sizing

DOI10.1287/MNSC.30.10.1255MaRDI QIDQ3737151zbMATH OpenOpenAlexFDO

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

Publication date 1984

Published in Management Science (Search for Journal in Brave)

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

zbMATH Keywords

Computational resultscutting plane algorithmMulti-item capacitated lot-sizingvalid inequalities

Mathematics Subject Classification ID

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

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

Cited in

(only showing first 100 items - show all)

• A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment
• Valid inequalities and separation for uncapacitated fixed charge networks
• Valid inequalities for mixed 0-1 programs
• A simple heuristic for the multi-item single level capacitated lotsizing problem
• Valid inequalities and separation for capacitated economic lot sizing
• Lot-size models with backlogging: Strong reformulations and cutting planes
• Strong formulations for mixed integer programming: A survey
• Primal-dual approach to the single level capacitated lot-sizing problem
• Capacitated lot-sizing and scheduling by Lagrangean relaxation
• An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem
• Two mixed integer programming formulations arising in manufacturing management
• Valid inequalities and facets of the capacitated plant location problem
• Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
• Lot sizing and scheduling -- survey and extensions
• A new dynamic programming algorithm for the single item capacitated dynamic lot size model
• Modelling piecewise linear concave costs in a tree partitioning problem
• Coordination of production and distribution planning
• A new heuristic approach for the multi-item dynamic lot sizing problem
• A linear description of the discrete lot-sizing and scheduling problem
• A branch-and-cut algorithm for vehicle routing problems
• Multi-item capacitated lot-sizing by a cross decomposition based algorithm
• A cutting plane approach to capacitated lot-sizing with start-up costs
• Progress with single-item lot-sizing
• Solving mixed integer programming production planning problems with setups by shadow price information.
• Projections of the capacitated network loading problem
• Heuristic genetic algorithms for general capacitated lot-sizing problems
• Partial objective inequalities for the multi-item capacitated lot-sizing problem
• Global optimality conditions for fixed charge quadratic programs
• Facets for single module and multi-module capacitated lot-sizing problems without backlogging
• Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
• Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
• Integrated production/distribution planning in supply chains: An invited review
• Facets and algorithms for capacitated lot sizing
• Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
• A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
• The application of valid inequalities to the multi-stage lot-sizing problem
• A computational analysis of lower bounds for big bucket production planning problems
• Multi-stage simultaneous lot-sizing and scheduling for flow line production
• Valid inequalities and separation for capacitated fixed charge flow problems
• The item dependent stockingcost constraint
• Robust formulations for economic lot-sizing problem with remanufacturing
• A risk-averse two-stage stochastic programming model for a joint multi-item capacitated line balancing and lot-sizing problem
• Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
• COAL: A new heuristic approach for solving the fixed charge problem - computational results
• Worst case analysis of relax and fix heuristics for lot-sizing problems
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
• Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms
• Capacitated replenishment and disposal planning for multiple products with resalable returns
• The multi-item capacitated lot-sizing problem with setup times and shortage costs
• Sequential pairing of mixed integer inequalities
• 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
• Single item lot sizing problems
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover
• Discrete multi-module capacitated lot-sizing problems with multiple items
• Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem
• Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
• Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
• A polyhedral study of multiechelon lot sizing with intermediate demands
• Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
• Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
• 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
• Period decompositions for the capacitated lot sizing problem with setup times
• Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
• The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
• A column generation-based heuristic algorithm for an inventory routing problem with perishable goods
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Tactical production and lot size planning with lifetime constraints: a comparison of model formulations
• An integrated model for inventory and production planning in a two-stage hybrid production system
• scientific article; zbMATH DE number 780785 (Why is no real title available?)
• Valid inequalities for the capacitated lot-sizing problem in a hybrid manufacturing and remanufacturing 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
• Single machine multi-product capacitated lot sizing with sequence-dependent setups
• Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
• The discrete lot-sizing and scheduling problem
• A Benders decomposition based heuristic for the hierarchical production planning problem
• Classical cuts for mixed-integer programming and branch-and-cut
• A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs
• Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups
• Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems
• Learning optimal solutions via an LSTM-optimization framework
• A non-anticipative learning-optimization framework for solving multi-stage stochastic programs
• On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
• Cutting planes in integer and mixed integer programming
• Integration of sales and operations: a dynamic mixed-integer programming game
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• Set partitioning and column generation heuristics for capacitated dynamic lotsizing
• Lot-sizing on a tree
• Box-constrained quadratic programs with fixed charge variables
• A heuristic approach for big bucket multi-level production planning problems
• Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight

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)