Alternative mathematical models and solution approaches for lot-sizing and scheduling problems in the brewery industry: analyzing two different situations (Q1993026): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57719345, #quickstatements; #temporary_batch_1704699890056
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Maristela Oliveira Santos / rank
Normal rank
 
Property / author
 
Property / author: Maristela Oliveira Santos / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2017/6754970 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2742762380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company / rank
 
Normal rank
Property / cites work
 
Property / cites work: An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous lotsizing and scheduling problems: a classification and review of models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lead time considerations for the multi-level capacitated lot-sizing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling the replenishment of just-in-time supermarkets in assembly plants / rank
 
Normal rank
Property / cites work
 
Property / cites work: The general lotsizing and scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated lot-sizing with sequence dependent setup costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:36, 17 July 2024

scientific article
Language Label Description Also known as
English
Alternative mathematical models and solution approaches for lot-sizing and scheduling problems in the brewery industry: analyzing two different situations
scientific article

    Statements

    Alternative mathematical models and solution approaches for lot-sizing and scheduling problems in the brewery industry: analyzing two different situations (English)
    0 references
    0 references
    0 references
    0 references
    5 November 2018
    0 references
    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.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references