Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
From MaRDI portal
(Redirected from Publication:490153)
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
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3557512 (Why is no real title available?)
- scientific article; zbMATH DE number 3568353 (Why is no real title available?)
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- A general heuristic for production planning problems
- A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures
- A single-product parallel-facilities production-planning model
- An Efficient Algorithm for Multi-Item Scheduling
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- Comparing Dantzig-Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- Dynamic Production Scheduling for a Process Industry
- Economic Lot Scheduling for Multiple Products on Parallel Identical Processors
- 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.
- LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
- Lagrangean relaxation based heuristics for lot sizing with setup times
- Lotsizing and scheduling on parallel machines with sequence-dependent setup costs
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- On alternative mixed integer programming formulations and LP-based heuristics for lot-sizing with setup times
- Simultaneous lotsizing and scheduling on parallel machines
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints
- Some Extensions of the Discrete Lotsizing and Scheduling Problem
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
Cited in
(18)- Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company
- scientific article; zbMATH DE number 6129056 (Why is no real title available?)
- 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
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)
