Uncapacitated Lot-Sizing Problems with Start-Up Costs

DOI10.1287/opre.37.5.741zbMath0696.90021MaRDI 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 inequalities; polynomial separation algorithm; uncapacitated economic lot-sizing

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C11: Mixed integer programming

90B05: Inventory, storage, reservoirs

90C39: Dynamic programming

Related Items

Modeling industrial lot sizing problems: a review, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, A cutting plane algorithm for MV portfolio selection model, A dual algorithm for the economic lot-sizing problem, Using separation algorithms to generate mixed integer model reformulations, MIP modelling of changeovers in production planning and scheduling problems, Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems, 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, A cutting plane approach to capacitated lot-sizing with start-up costs, Projections of the capacitated network loading problem, A cutting plane algorithm for a single machine scheduling problem