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

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)

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

(98)

• Classical cuts for mixed-integer programming and branch-and-cut
• The multi-item capacitated lot-sizing problem with setup times and shortage costs
• Lot-sizing on a tree
• An integrated model for inventory and production planning in a two-stage hybrid production system
• A branch-and-cut algorithm for vehicle routing problems
• Facets for single module and multi-module capacitated lot-sizing problems without backlogging
• Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms
• Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Two mixed integer programming formulations arising in manufacturing management
• Primal-dual approach to the single level capacitated lot-sizing problem
• Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups
• A column generation-based heuristic algorithm for an inventory routing problem with perishable goods
• 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
• Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
• Learning optimal solutions via an LSTM-optimization framework
• Valid inequalities and separation for uncapacitated fixed charge networks
• Robust formulations for economic lot-sizing problem with remanufacturing
• Valid inequalities and separation for capacitated fixed charge flow problems
• Box-constrained quadratic programs with fixed charge variables
• Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
• Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
• A cutting plane approach to capacitated lot-sizing with start-up costs
• Integration of sales and operations: a dynamic mixed-integer programming game
• 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
• Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems
• COAL: A new heuristic approach for solving the fixed charge problem - computational results
• 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
• Solving mixed integer programming production planning problems with setups by shadow price information.
• A linear description of the discrete lot-sizing and scheduling problem
• scientific article; zbMATH DE number 780785 (Why is no real title available?)
• Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
• Single machine multi-product capacitated lot sizing with sequence-dependent setups
• The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
• Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems
• Predictive search for capacitated multi-item lot sizing problems
• 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 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
• A polyhedral study of multiechelon lot sizing with intermediate demands
• 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
• Valid inequalities for the capacitated lot-sizing problem in a hybrid manufacturing and remanufacturing system
• The discrete lot-sizing and scheduling problem
• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering 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
• Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover
• 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
• Global optimality conditions for fixed charge quadratic programs
• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• Valid inequalities and facets of the capacitated plant location problem
• Modelling piecewise linear concave costs in a tree partitioning problem
• Capacitated replenishment and disposal planning for multiple products with resalable returns
• 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
• 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
• Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
• 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
• Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem
• Tactical production and lot size planning with lifetime constraints: a comparison of model formulations
• Worst case analysis of relax and fix heuristics for lot-sizing problems
• 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
• Cutting planes in integer and mixed integer programming
• Multi-item capacitated lot-sizing by a cross decomposition based algorithm
• 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
• A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs
• 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
• Solving multi-item lot-sizing problems with an MIP solver using classification and reformulation
• 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
• The item dependent stockingcost constraint
• Strong formulations for mixed integer programming: A survey
• Period decompositions for the capacitated lot sizing problem with setup times

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)