Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry
From MaRDI portal
Publication:6168345
DOI10.1007/s43069-023-00230-7zbMath1519.90001arXiv2107.10738MaRDI QIDQ6168345
Márcio S. Kawamura, Débora P. Ronconi, Ernesto G. Birgin, Kennedy A. G. Araújo
Publication date: 8 August 2023
Published in: SN Operations Research Forum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.10738
Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Cites Work
- A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times
- Capacitated lot-sizing with extensions: a review
- Capacitated lot sizing and sequence dependent setup scheduling: An iterative approach for integration
- Lot sizing and scheduling -- survey and extensions
- The general lotsizing and scheduling problem
- Simultaneous lotsizing and scheduling on parallel machines
- Simultaneous lotsizing and scheduling considering secondary resources: a general model, literature review and classification
- Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
- A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production
- A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
- Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- Rolling-horizon lot-sizing when set-up times are sequence-dependent
- Production Planning by Mixed Integer Programming
This page was built for publication: Relax-and-fix heuristics applied to a real-world lot sizing and scheduling problem in the personal care consumer goods industry