An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times

DOI10.1007/s10479-011-1026-9zbMath1251.90200OpenAlexW2035405465MaRDI QIDQ1761844

Jie Song, Tao Wu, Shi, Leyuan

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-011-1026-9

zbMATH Keywords

linear programmingrelax-and-fixcapacitated multi-level lot-sizingMIP-based interval heuristic

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

The green capacitated multi-item lot sizing problem with parallel machines ⋮ Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ A mixed-integer programming model for an integrated production planning problem with preventive maintenance in the pulp and paper industry ⋮ A sustainable inventory model to study the mixing and bottling plant of single item for cost minimization ⋮ New construction heuristic for capacitated lot sizing problems ⋮ Alternative mathematical models and solution approaches for lot-sizing and scheduling problems in the brewery industry: analyzing two different situations ⋮ A robust optimization model for multi-product two-stage capacitated production planning under uncertainty ⋮ Worst case analysis of relax and fix heuristics for lot-sizing problems

Uses Software

• bc-prod

Cites Work

• Unnamed Item
• A heuristic approach for big bucket multi-level production planning problems
• Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
• A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures
• Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
• An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
• The Capacitated Lot-Sizing Problem with Linked Lot Sizes
• bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
• Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
• Uncapacitated lot-sizing: The convex hull of solutions
• MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
• Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
• Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
• A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times