Decomposition based heuristics for a lot sizing and scheduling problem on multiple heterogeneous production lines with perishable products

Soler, Willy A. de Oliveira and Santos, Maristela O. and Akartunali, Kerem (2021) Decomposition based heuristics for a lot sizing and scheduling problem on multiple heterogeneous production lines with perishable products. Pesquisa Operacional, 41. e240377. ISSN 1678-5142 (https://doi.org/10.1590/0101-7438.2021.041s1.00240...)

[thumbnail of Soler-etal-PO-2021-Decomposition-based-heuristics-for-a-lot-sizing-and-scheduling-problem]
Preview
 Text. Filename: Soler_etal_PO_2021_Decomposition_based_heuristics_for_a_lot_sizing_and_scheduling_problem.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (247kB)| Preview

Abstract

In this paper, we propose a novel MIP-based heuristic method to deal with a lot sizing and scheduling problem with multiple heterogeneous production lines in a production setting with perishable items. The problem is inspired by the production processes adopted by some Brazilian food industries and it considers that several production lines share the same scarce production resources. Therefore, only a subset of those lines can simultaneously operate in each production period. Moreover, the production environment is characterized by the existence of sequence-dependent setup times and costs, and by the production of perishable items which can be stocked for a short period only. Firstly, we propose a facility location reformulation for a model previously proposed in the literature. Secondly, we propose a heuristic composed of two phases. The first phase has an elaborated approach to building feasible solutions solving initially an aggregated lot sizing problem to decide which production lines to assemble, followed by the resolution of the various single line lot sizing and scheduling problems. The second phase applies improvement heuristics exploring principles of fix-and-optimize and local branching procedures. Computational results carried out using a data set proposed in the literature are presented in order to study the efficiency of the proposed approach. The results demonstrate that our heuristics provide superior results when benchmarked with a heuristic from the literature specifically developed to solve the problem under consideration, and with a commercial MIP solver.

ORCID iDs

Soler, Willy A. de Oliveira, Santos, Maristela O. and Akartunali, Kerem ORCID logoORCID: https://orcid.org/0000-0003-0169-3833;
CORE (COnnecting REpositories)