• JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
  • JoomlaWorks Simple Image Rotator
 
  Bookmark and Share
 
 
Master's Dissertation
DOI
Document
Author
Full name
Rudivan Paixão Barbosa
E-mail
Institute/School/College
Knowledge Area
Date of Defense
Published
São Carlos, 2019
Supervisor
Committee
Santos, Maristela Oliveira dos (President)
Andretta, Marina
Pureza, Vitória Maria Miranda
Toso, Eli Angela Vitor
Title in Portuguese
Abordagens de solução para o problema de dimensionamento e sequenciamento de lotes com aceitação de pedidos
Keywords in Portuguese
Aceitação de pedidos
Dimensionamento e sequenciamento de lotes
Heurísticas
Abstract in Portuguese
Nesta dissertação abordamos o problema de dimensionamento e sequenciamento de lotes com aceitação de pedidos. As demandas dos clientes são agregadas em pedidos, os quais podem ou não ser aceitos e devem ser entregues dentro de uma janela de tempo. Os itens são perecíveis e podem permanecer no estoque somente por um tempo determinado (shelf-life). O objetivo do problema é maximizar a receita gerada pelo atendimento dos pedidos, descontando os custos de estoque e das preparações da máquina. Para tratar o problema são propostas formulações matemáticas e abordagens heurísticas contendo uma etapa construtiva seguida por uma heurística de melhoramento. Testes computacionais foram realizados e os resultados obtidos foram analisados. As heurísticas obtiveram desempenho superior ao branch-and-cut do solver de otimização na obtenção de soluções de boa qualidade, no limite de tempo estabelecido.
Title in English
Solution approaches for lot sizing and scheduling problem with order acceptance
Keywords in English
Heuristics
Lot sizing an scheduling
Order acceptance
Abstract in English
In this dissertation, we approach the lot sizing and scheduling problem with order acceptance. Customers demands are aggregated into orders, which may or may not be accepted and must be delivered within a time window. The items are perishable and can remain in inventory only for a limited time (shelf-life). The aim of the problem is profit maximizing generated by orders acceptance, discounting inventory and machine setups costs. To deal with this problem math formulations, constructive and improvement heuristics were proposed. Computational tests were performed and the results obtained were analyzed. The heuristics obtained superior performance then branch-and-cut of the optimization solver obtaining good quality solutions within the established time limit.
 
WARNING - Viewing this document is conditioned on your acceptance of the following terms of use:
This document is only for private use for research and teaching activities. Reproduction for commercial use is forbidden. This rights cover the whole data about this document as well as its contents. Any uses or copies of this document in whole or in part must include the author's name.
Publishing Date
2019-09-24
 
WARNING: Learn what derived works are clicking here.
All rights of the thesis/dissertation are from the authors
CeTI-SC/STI
Digital Library of Theses and Dissertations of USP. Copyright © 2001-2020. All rights reserved.