Uncapacitated Lot-Sizing Problems with Start-Up Costs

DOI10.1287/opre.37.5.741zbMath0696.90021OpenAlexW2072193992MaRDI QIDQ3474475

Laurence A. Wolsey

Publication date: 1989

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8df9a49fa3d6f9e51409378bc2eb22ab66e84334

zbMATH Keywords

strong valid inequalitiespolynomial separation algorithmuncapacitated economic lot-sizing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items

On practical resource allocation for production planning and scheduling with period overlapping setups, CMIT, capacitated multi-level implosion tool, A Lagrangean decomposition solution to a single line multiproduct scheduling problem, Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, A cutting plane approach to capacitated lot-sizing with start-up costs, Single-item dynamic lot-sizing problems: an updated survey, Modeling industrial lot sizing problems: a review, A dual algorithm for the economic lot-sizing problem, An Outer Approximation Algorithm for Capacitated Disassembly Scheduling Problem with Parts Commonality and Random Demand, Using separation algorithms to generate mixed integer model reformulations, MIP modelling of changeovers in production planning and scheduling problems, A cutting plane algorithm for MV portfolio selection model, Projections of the capacitated network loading problem, Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups, A cutting plane algorithm for a single machine scheduling problem, Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems