Lagrangian-based heuristics for production planning with perishable products, scarce resources, and sequence-dependent setup times
- 7 November 2024
- journal article
- research article
- Published by Springer Nature in Journal of Heuristics
- Vol. 31 (1) , 1-35
Abstract
No abstract availableKeywords
Funding Information
- Conselho Nacional de Desenvolvimento Científico e Tecnológico (307466/2021-3)
- Centro de Ciências Matemáticas Aplicadas à Indústria (FAPESP grant 2013/07375-0)
- Air Force Office of Scientific Research (FA 9550-18-1-7003)
- São Paulo Research Foundation - FAPESP (2024/07482-5)
This publication has 38 references indexed in Scilit:
- A View of Lagrangian Relaxation and Its Applications2020
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventoryOR Spectrum, 2015
- A computational analysis of lower bounds for big bucket production planning problemsComputational Optimization and Applications, 2012
- Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setupsJournal of Scheduling, 2010
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- The general lotsizing and scheduling problemOR Spectrum, 1997
- Capacitated lot-sizing with sequence dependent setup costsOR Spectrum, 1996
- Lagrangean decomposition: A model yielding stronger lagrangean boundsMathematical Programming, 1987
- Validation of subgradient optimizationMathematical Programming, 1974
- Lagrangean relaxation for integer programming1974