Lagrangean relaxation based heuristics for lot sizing with setup times
From MaRDI portal
Publication:953424
DOI10.1016/J.EJOR.2007.11.052zbMATH Open1179.90023OpenAlexW2012229304MaRDI QIDQ953424FDOQ953424
Authors: Haldun Süral, Meltem Denizel, Luk N. Van Wassenhove 
Publication date: 20 November 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.11.052
Recommendations
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
- A Lagrangian heuristic for capacitated single item lot sizing problems
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Cites Work
- Production Planning by Mixed Integer Programming
- Dynamic version of the economic lot size model
- Single item lot sizing problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Lot Sizes, Lead Times and In-Process Inventories
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
- A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility
- Primal-dual approach to the single level capacitated lot-sizing problem
- Lot sizing in general assembly systems with setup costs, setup times, and multiple constrained resources
- Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources
- Lot Sizing in Serial Assembly Systems with Multiple Constrained Resources
Cited In (26)
- HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry
- Just-in-time planning and lot-sizing
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
- Classification and literature review of integrated lot-sizing and cutting stock problems
- A Lagrangian relaxation approach to the mixed-product assembly line sequencing problem: a case study of a door-lock company in Taiwan
- Motivations and analysis of the capacitated lot-sizing problem with setup times and minimum and maximum ending inventories
- Predictive search for capacitated multi-item lot sizing problems
- Title not available (Why is that?)
- A horizon decomposition approach for the capacitated lot-sizing problem with setup times
- A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
- A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem
- MIP formulations and heuristics for two-level production-transportation problems
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
- Local cuts and two-period convex hull closures for big-bucket lot-sizing problems
- The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- Worst case analysis of relax and fix heuristics for lot-sizing problems
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- New construction heuristic for capacitated lot sizing problems
- An integrated approach for production lot sizing and raw material purchasing
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
- A capacitated lot sizing problem with stochastic setup times and overtime
- Period decompositions for the capacitated lot sizing problem with setup times
- On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
This page was built for publication: Lagrangean relaxation based heuristics for lot sizing with setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953424)
