Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
From MaRDI portal
Publication:490153
DOI10.1007/S10479-014-1570-1zbMATH Open1303.90072OpenAlexW2000176534MaRDI QIDQ490153FDOQ490153
Authors: 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
Recommendations
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- Hybrid methods for lot sizing on parallel machines
- Lagrangean relaxation based heuristics for lot sizing with setup times
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
- Period decompositions for the capacitated lot sizing problem with setup times
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Production models (90B30)
Cites Work
- Title not available (Why is that?)
- Simultaneous lotsizing and scheduling on parallel machines
- Lotsizing and scheduling on parallel machines with sequence-dependent setup costs
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Title not available (Why is that?)
- LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Lagrangean relaxation 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
- A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures
- Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Title not available (Why is that?)
- Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
- 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.
- Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company
- 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
- A single-product parallel-facilities production-planning model
- Some Extensions of the Discrete Lotsizing and Scheduling Problem
- Dynamic Production Scheduling for a Process Industry
- An Efficient Algorithm for Multi-Item Scheduling
- On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
- A general heuristic for production planning problems
Cited In (18)
- Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company
- Title not available (Why is that?)
- A feasibility-ensured Lagrangian heuristic for general decomposable problems
- Classification and literature review of integrated lot-sizing and cutting stock problems
- A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
- The green capacitated multi-item lot sizing problem with parallel machines
- MIP formulations for a rich real-world lot-sizing problem with setup carryover
- Analytics branching and selection for the capacitated multi-item lot sizing problem with nonidentical machines
- Lagrangean relaxation based heuristics for lot sizing with setup times
- A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times
- Hybrid methods for lot sizing on parallel machines
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
- A Lagrangian heuristic for capacitated single item lot sizing problems
- A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- A heuristic approach for the integrated production-transportation problem with process flexibility
- Period decompositions for the capacitated lot sizing problem with setup times
Uses Software
This page was built for publication: Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490153)
