Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
From MaRDI portal
Publication:3392091
DOI10.1287/opre.1070.0392zbMath1167.90322OpenAlexW2160350284MaRDI QIDQ3392091
Awi Federgruen, Joern Meissner, Michal Tzur
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
Comments on: On a mixture of the fix-and-relax coordination and Lagrangean substitution schemes for multistage stochastic mixed integer programming, Dynamic capacitated lot-sizing problems: a classification and review of solution approaches, A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders, Mixed integer programming based heuristics for the patient admission scheduling problem, Production planning with order acceptance and demand uncertainty, On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay, Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms, Using and extending fix-and-relax to solve maritime inventory routing problems, Predictive Search for Capacitated Multi-Item Lot Sizing Problems, A computational analysis of lower bounds for big bucket production planning problems, Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems, Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem, Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions, Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines, Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing, The dynamic-demand joint replenishment problem with approximated transportation costs, Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem, Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials, 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, An efficient matheuristic for offline patient-to-bed assignment problems, A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems, Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories, Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics, The production planning problem of orders in small foundries, Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost, Worst case analysis of relax and fix heuristics for lot-sizing 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, Pricing, relaxing and fixing under lot sizing and scheduling
