Lagrangean relaxation based heuristics for lot sizing with setup times

DOI10.1016/J.EJOR.2007.11.052zbMath1179.90023OpenAlexW2012229304MaRDI QIDQ953424

Meltem Denizel, Haldun Süral, 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

zbMATH Keywords

Lagrangean relaxationinventorysetup timeheuristicreformulation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (18)

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 ⋮ Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ New construction heuristic for capacitated lot sizing problems ⋮ Just-in-Time Planning and Lot-Sizing ⋮ Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems ⋮ A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times ⋮ Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines ⋮ An integrated approach for production lot sizing and raw material purchasing ⋮ A capacitated lot sizing problem with stochastic setup times and overtime ⋮ HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry ⋮ MIP formulations and heuristics for two-level production-transportation problems ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times ⋮ The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs ⋮ A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times ⋮ Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
• Primal-dual approach to the single level capacitated lot-sizing problem
• Capacitated lot-sizing and scheduling by Lagrangean relaxation
• Improved lower bounds for the capacitated lot sizing problem with setup times.
• Single item lot sizing problems
• Dynamic Version of the Economic Lot Size Model
• Lot Sizing in General Assembly Systems with Setup Costs, Setup Times, and Multiple Constrained Resources
• A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility
• On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
• Lot Sizes, Lead Times and In-Process Inventories
• Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources
• A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
• Lot Sizing in Serial Assembly Systems with Multiple Constrained Resources
• Production Planning by Mixed Integer Programming

This page was built for publication: Lagrangean relaxation based heuristics for lot sizing with setup times