On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times

DOI10.1007/s10898-011-9728-8zbMath1259.90079OpenAlexW2097607158MaRDI QIDQ695342

Tao Wu, Kerem Akartunalı, Joseph Geunes, Shi, Leyuan

Publication date: 21 December 2012

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://strathprints.strath.ac.uk/37400/

zbMATH Keywords

facility locationshortest routerelax-and-fixcapacitated multi-level lot sizinginventory and lot sizing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)

Related Items (7)

Lead time considerations for the multi-level capacitated lot-sizing problem ⋮ A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders ⋮ Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms ⋮ Progressive Selection Method for the Coupled Lot-Sizing and Cutting-Stock Problem ⋮ Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines ⋮ Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials ⋮ A robust optimization model for multi-product two-stage capacitated production planning under uncertainty

Uses Software

• bc-prod

Cites Work

• Unnamed Item
• Unnamed Item
• Particle swarm optimization for bi-level pricing problems in supply chains
• A heuristic approach for big bucket multi-level production planning problems
• Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
• Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
• A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
• An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
• bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
• Encyclopedia of Optimization
• 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
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times

This page was built for publication: On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times