Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
From MaRDI portal
Publication:490153
DOI10.1007/s10479-014-1570-1zbMath1303.90072OpenAlexW2000176534MaRDI QIDQ490153
Diego Jacinto Fiorotto, Silvio Alexandre de Araujo
Publication date: 22 January 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-014-1570-1
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items (7)
Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ The green capacitated multi-item lot sizing problem with parallel machines ⋮ Hybrid methods for lot sizing on parallel machines ⋮ Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ A feasibility-ensured Lagrangian heuristic for general decomposable problems ⋮ MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Lagrangean relaxation based heuristics for lot sizing with setup times
- Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
- A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- Simultaneous lotsizing and scheduling on parallel machines
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company
- A General Heuristic for Production Planning Problems
- Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
- Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Economic Lot Scheduling for Multiple Products on Parallel Identical Processors
- Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- A single-product parallel-facilities production-planning model
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Some Extensions of the Discrete Lotsizing and Scheduling Problem
- Dynamic Production Scheduling for a Process Industry
- LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
- An Efficient Algorithm for Multi-Item Scheduling
This page was built for publication: Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
