Alternative mathematical models and solution approaches for lot-sizing and scheduling problems in the brewery industry: analyzing two different situations
type: Item
instance of: scholarly article
title: Alternative mathematical models and solution approaches for lot-sizing and scheduling problems in the brewery industry: analyzing two different situations
zbMATH Open document ID: 1426.90008
DOI: 10.1155/2017/6754970
author: Tamara A. Baldo
author: Reinaldo Morabito
author: L. Guimarães
author: Maristela O. Santos
published in: Mathematical Problems in Engineering
publication date: 2018-11-05T00:00:00Z
review text: Summary: This research proposes new approaches to deal with the production planning and scheduling problem in brewery facilities. Two real situations found in factories are addressed, which differ by considering (or not) the setup operations in tanks that provide liquid for bottling lines. Depending on the technology involved in the production process, the number of tank swaps is relevant (Case A) or it can be neglected (Case B). For both scenarios, new MIP (Mixed Integer Programming) formulations and heuristic solution methods based on these formulations are proposed. In order to evaluate the approach for Case A, we compare the results of a previous study with the results obtained in this paper. For the solution methods and the result analysis of Case B, we propose adaptations of Case A approaches yielding an alternative MIP formulation to represent it. Therefore, the main contributions of this article are twofold: (i) to propose alternative MIP models and solution methods for the problem in Case A, providing better results than previously reported, and (ii) to propose new MIP models and solution methods for Case B, analyzing and comparing the results and benefits for Case B considering the technology investment required.
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 6972373
Wikidata QID: Q57719345
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2017/6754970
OpenAlex ID: W2742762380
cites work: Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company
cites work: An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
cites work: Simultaneous lotsizing and scheduling problems: a classification and review of models
cites work: Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching
cites work: Lead time considerations for the multi-level capacitated lot-sizing problem
cites work: Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator
cites work: Scheduling the replenishment of just-in-time supermarkets in assembly plants
cites work: The general lotsizing and scheduling problem
cites work: Capacitated lot-sizing with sequence dependent setup costs
cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
cites work: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Q4943600
cites work: Benchmarking optimization software with performance profiles.
cites work: Decomposition Principle for Linear Programs
description: scientific article; zbMATH DE number 6972373