Strong Formulations for Multi-Item Capacitated Lot Sizing
From MaRDI portal
Publication:3737151
DOI10.1287/mnsc.30.10.1255zbMath0601.90037OpenAlexW2019590415MaRDI QIDQ3737151
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
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)
Related Items
Valid inequalities for mixed 0-1 programs, Modelling piecewise linear concave costs in a tree partitioning problem, Coordination of production and distribution planning, A simple heuristic for the multi-item single level capacitated lotsizing problem, A new heuristic approach for the multi-item dynamic lot sizing problem, A linear description of the discrete lot-sizing and scheduling problem, Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups, A branch-and-cut algorithm for vehicle routing problems, Multi-item capacitated lot-sizing by a cross decomposition based algorithm, 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, Dynamic capacitated lot-sizing problems: a classification and review of solution approaches, Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times, A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, Multi-product valid inequalities for the discrete lot-sizing and scheduling problem, Partial objective inequalities for the multi-item capacitated lot-sizing problem, A cutting plane approach to capacitated lot-sizing with start-up costs, 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, Lot-size models with backlogging: Strong reformulations and cutting planes, 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, Predictive Search for Capacitated Multi-Item Lot Sizing Problems, Strong formulations for mixed integer programming: A survey, Global optimality conditions for fixed charge quadratic programs, Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty, A column generation-based heuristic algorithm for an inventory routing problem with perishable goods, Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover, Progress with single-item lot-sizing, Self-adaptive randomized constructive heuristics for the multi-item capacitated 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, Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations, 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, Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems, Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems, Learning optimal solutions via an LSTM-optimization framework, Solving mixed integer programming production planning problems with setups by shadow price information., Valid inequalities and separation for capacitated fixed charge flow problems, Analysis of relaxations for the multi-item capacitated lot-sizing problem, Set partitioning and column generation heuristics for capacitated dynamic lotsizing, Box-constrained quadratic programs with fixed charge variables, Primal-dual approach to the single level capacitated lot-sizing problem, Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials, Classical cuts for mixed-integer programming and branch-and-cut, The multi-item capacitated lot-sizing problem with setup times and shortage costs, Sequential pairing of mixed integer inequalities, Capacitated lot-sizing and scheduling by Lagrangean relaxation, A heuristic approach for big bucket multi-level production planning problems, Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case, Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company, On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times, Cutting planes in integer and mixed integer programming, The item dependent stockingcost constraint, Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight, 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 capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times, Multi-item dynamic production-distribution planning in process industries with divergent finishing stages, COAL: A new heuristic approach for solving the fixed charge problem - computational results, The discrete lot-sizing and scheduling problem, A Benders decomposition based heuristic for the hierarchical production planning problem, Robust formulations for economic lot-sizing problem with remanufacturing, Integrated inventory model for similar products under a two-echelon supply chain environment: an empirical study, Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times, A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment, An integrated model for inventory and production planning in a two-stage hybrid production system, 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, Integrated production/distribution planning in supply chains: An invited review, Worst case analysis of relax and fix heuristics for lot-sizing problems, Lot sizing and scheduling -- survey and extensions, Facets and algorithms for capacitated lot sizing, Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds, Projections of the capacitated network loading problem, Single item lot sizing problems, A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem, Valid inequalities and separation for uncapacitated fixed charge networks, A new dynamic programming algorithm for the single item capacitated dynamic lot size model, Multilevel capacitated lotsizing complexity and LP-based heuristics, Heuristic genetic algorithms for general capacitated lot-sizing problems, Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
