Hybrid methods for lot sizing on parallel machines
From MaRDI portal
Publication:342050
DOI10.1016/j.cor.2015.04.015zbMath1349.90018OpenAlexW2027427296MaRDI QIDQ342050
Diego Jacinto Fiorotto, Silvio Alexandre de Araujo, Raf Jans
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.04.015
Lagrangian relaxationparallel machinesDantzig-Wolfe decompositionlot sizinghybrid methodsreformulation
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items
The green capacitated multi-item lot sizing problem with parallel machines ⋮ Dantzig-Wolfe decomposition for the facility location and production planning problem ⋮ Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover ⋮ Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries ⋮ Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines ⋮ An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems
Uses Software
Cites Work
- Unnamed Item
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
- Set partitioning and column generation heuristics for capacitated dynamic lotsizing
- A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures
- 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
- New developments in the primal-dual column generation technique
- A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
- Statistical search methods for lotsizing problems
- 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
- Dynamic Version of the Economic Lot Size Model
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
- Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs
- Decomposition Principle for Linear Programs
- Dual-Optimal Inequalities for Stabilized Column Generation
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Period Decompositions 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
- The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Some Extensions of the Discrete Lotsizing and Scheduling Problem
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
- A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
- Dynamic Production Scheduling for a Process Industry
- Efficient Solution of the Single-item, Capacitated Lot-sizing Problem with Start-up and Reservation Costs
- Solving the CLSP by a Tabu Search Heuristic
- Combining Column Generation and Lagrangian Relaxation
- An Efficient Algorithm for Multi-Item Scheduling
