Busca avançada
Ano de início
Entree
(Referência obtida automaticamente do Web of Science, por meio da informação sobre o financiamento pela FAPESP e o número do processo correspondente, incluída na publicação pelos autores.)

Optimization models for a lot sizing and scheduling problem on parallel production lines that share scarce resources

Texto completo
Autor(es):
Alves de Oliveira Soler, Willy [1] ; Oliveira Santos, Maristela [2] ; Rangel, Socorro [3]
Número total de Autores: 3
Afiliação do(s) autor(es):
[1] UFMS Univ Fed Mato Grosso do Sul, Inst Matemat, Campo Grande, MS - Brazil
[2] Univ Sao Paulo, Inst Ciancias Matemat & Comp, Sao Carlos, SP - Brazil
[3] UNESP Univ Estadual Paulista, Dept Matemat, BR-15054000 Sao Jose Do Rio Preto, SP - Brazil
Número total de Afiliações: 3
Tipo de documento: Artigo Científico
Fonte: RAIRO-OPERATIONS RESEARCH; v. 55, n. 3, p. 1949-1970, JUN 28 2021.
Citações Web of Science: 0
Resumo

The purpose of this paper is to propose mathematical models to represent a lot sizing and scheduling problem on multiple production lines that share scarce resources and to investigate the computational performance of the proposed models. The main feature that differentiates this problem from others in the literature is that the decision on which lines to organize should be taken considering the availability of the necessary resources. The optimization criterion is the minimization of the costs incurred in the production process (inventory, backlogging, organization of production lines, and sequence-dependent setup costs). Nine mixed integer optimization models to represent the problem are given and, also, the results of an extensive computational study carried out using a set of instances from the literature. The computational study indicates that an efficient formulation, able to provide high quality solutions for large sized instances, can be obtained from a classical model by making the binary production variables explicit, using the facility location reformulation as well as the single commodity flow constraints to eliminate subsequences. Moreover, from the results, it is also clear that the consideration of scarce resources makes the problem significantly more difficult than the traditional one. (AU)

Processo FAPESP: 13/07375-0 - CeMEAI - Centro de Ciências Matemáticas Aplicadas à Indústria
Beneficiário:Francisco Louzada Neto
Modalidade de apoio: Auxílio à Pesquisa - Centros de Pesquisa, Inovação e Difusão - CEPIDs
Processo FAPESP: 16/01860-1 - Problemas de corte, empacotamento, dimensionamento de lotes, programação da produção, roteamento, localização e suas integrações em contextos industriais e logísticos
Beneficiário:Reinaldo Morabito Neto
Modalidade de apoio: Auxílio à Pesquisa - Temático