Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
From MaRDI portal
Publication:3392091
DOI10.1287/opre.1070.0392zbMath1167.90322MaRDI QIDQ3392091
Michal Tzur, Joern Meissner, Awi Federgruen
Publication date: 13 August 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.meiss.com/download/SC-Federgruen-Meissner-Tzur.pdf
Related Items
A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders, On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay, Using and extending fix-and-relax to solve maritime inventory routing problems, Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics, Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions, Comments on: On a mixture of the fix-and-relax coordination and Lagrangean substitution schemes for multistage stochastic mixed integer programming, A heuristic approach for big bucket multi-level production planning problems, Solution approaches for the soft drink integrated production lot sizing and scheduling problem, Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants, Efficient and effective heuristics for the coordinated capacitated lot-size problem, A computational analysis of lower bounds for big bucket production planning problems, Pricing, relaxing and fixing under lot sizing and scheduling, Dynamic capacitated lot-sizing problems: a classification and review of solution approaches, Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms, Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost
