Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
From MaRDI portal
Publication:3392091
DOI10.1287/OPRE.1070.0392zbMATH Open1167.90322OpenAlexW2160350284MaRDI QIDQ3392091FDOQ3392091
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
Recommendations
- Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
- Set partitioning and column generation heuristics for capacitated dynamic lotsizing
- Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups
- The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
- Multi-item lot-sizing with joint set-up costs
Cited In (32)
- Predictive Search for Capacitated Multi-Item Lot Sizing Problems
- Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms
- An efficient matheuristic for offline patient-to-bed assignment problems
- The dynamic-demand joint replenishment problem with approximated transportation costs
- Comments on: On a mixture of the fix-and-relax coordination and Lagrangean substitution schemes for multistage stochastic mixed integer programming
- Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines
- 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
- Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories
- Valid inequalities for two-period relaxations of big-bucket lot-sizing problems: zero setup case
- Mixed integer programming based heuristics for the patient admission scheduling problem
- A computational analysis of lower bounds for big bucket production planning problems
- Efficient and effective heuristics for the coordinated capacitated lot-size problem
- Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics
- Production planning with order acceptance and demand uncertainty
- Problem space search metaheuristics with fix and optimize approach for the integrated fleet sizing and replenishment planning problem
- Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost
- Using and extending fix-and-relax to solve maritime inventory routing problems
- Optimizing a binary integer program by identifying its optimal core problem -- a new optimization concept applied to the multidimensional knapsack problem
- A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- On production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decay
- Worst case analysis of relax and fix heuristics for lot-sizing problems
- Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
- 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
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
- Pricing, relaxing and fixing under lot sizing and scheduling
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
- The production planning problem of orders in small foundries
This page was built for publication: Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392091)
