Lot-size models with backlogging: Strong reformulations and cutting planes

DOI10.1007/BF01580738zbMath0663.90038OpenAlexW2010520994MaRDI QIDQ1115342

Publication date: 1988

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580738

zbMATH Keywords

shortest path production planning facility location backlogging uncapacitated lot-sizing violated cutting plane algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Linear programming (90C05) Production models (90B30) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05)

Related Items

New lot sizing heuristics for demand and price uncertainties with service-level constraint, Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems, Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales, 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, Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms, A branch-and-price algorithm for the capacitated facility location problem, Strong formulations for mixed integer programming: A survey, Two-stage stochastic lot-sizing problem under cost uncertainty, Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover, Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs, New valid inequalities and formulations for the static joint chance-constrained lot-sizing problem, Relaxations for two-level multi-item lot-sizing problems, A computational analysis of lower bounds for big bucket production planning problems, A cost-sharing method for the multi-level economic lot-sizing game, Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations, Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem, Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems, LS-LIB: A Library of Tools for Solving Production Planning Problems, A polyhedral study of the static probabilistic lot-sizing problem, A polyhedral study of lot-sizing with supplier selection, Analysis of relaxations for the multi-item capacitated lot-sizing problem, On the cut polyhedron., Capacitated lot-sizing with extensions: a review, Modeling industrial lot sizing problems: a review, 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, A hybrid firefly-genetic algorithm for the capacitated facility location problem, A heuristic approach for big bucket multi-level production planning problems, Uncapacitated lot-sizing with buying, sales and backlogging, Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution, A Lagrangean heuristic for the plant location problem with multiple facilities in the same site, Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity, An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging, Classification and literature review of integrated lot-sizing and cutting stock problems, Polyhedra for lot-sizing with Wagner-Whitin costs, Two mixed integer programming formulations arising in manufacturing management, A branch and bound method for stochastic integer problems under probabilistic constraints, A cost-sharing method for an economic lot-sizing game, Uncapacitated lot sizing with backlogging: the convex hull, Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over, On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid, Facets and algorithms for capacitated lot sizing, Projections of the capacitated network loading problem, Single item lot sizing problems, ``Facet separation with one linear program, Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems, A comparison of heuristics and relaxations for the capacitated plant location problem

Cites Work