• 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
https://doi.org/10.11606/D.18.2021.tde-07122021-164135
Document
Author
Full name
Fernando Siqueira de Almeida
Institute/School/College
Knowledge Area
Date of Defense
Published
São Carlos, 2021
Supervisor
Committee
Nagano, Marcelo Seido (President)
Silva, Fabio Molina da
Takano, Mauricio Iwama
Title in English
Heuristics for multi-objective no-wait flow shops with sequence-dependent setup times
Keywords in English
Flow shop
Makespan
No-wait
Sequence-dependent setup times
Total completion time
Total tardiness
Abstract in English
Productive systems often involve several objectives and constraints that need to be considered by the scheduler. Under these circumstances, solving scheduling problems with multiple criteria tends to be the most appropriate approach. In this context, the no-wait flow shop problem with sequence-dependent setup times is addressed. The performance measures makespan, total completion time and total tardiness are approached in pairs to form functions ε(M1|M2), in which the objective is to minimize M1 subject to an upper bound on M2. Since this problem is known to be NP-hard, using exact methods for large instances can be impractical. As an alternative, heuristic methods have been developed to speed up the process of finding satisfactory solutions. In this Thesis, state-of-the-art methods for similar problems found in the literature are selected in order to explore opportunities for improvement. Focusing on simplicity of implementation and efficiency of execution, different heuristic methods are proposed. Extensive experiments are performed to evaluate performance. The results show that the proposed heuristics outperform the existing methods in solution quality and computational efficiency.
Title in Portuguese
Heurísticas para no-wait flow shops multi-objetivo com tempos de preparação dependentes da sequência
Keywords in Portuguese
Flow shop
Makespan
No-wait
Sequence-dependent setup times
Total completion time
Total tardiness
Abstract in Portuguese
Sistemas produtivos geralmente envolvem vários objetivos e restrições que precisam ser considerados pelo programador. Nessas circunstâncias, resolver problemas de programação com múltiplos critérios tende a ser a abordagem mais adequada. Nesse contexto, o problema no-wait flow shop com tempos de preparação dependentes da sequência é abordado. As medidas de desempenho makespan, total completion time e total tardiness são abordadas em pares para formar funções ε(M1|M2), nas quais o objetivo é minimizar M1 sujeito a um limite superior em M2. Como esse problema é conhecido por ser NP-hard, usar métodos exatos para instâncias grandes geralmente são impraticáveis. Como alternativa, métodos heurísticos têm sido desenvolvidos para acelerar o processo de busca de soluções satisfatórias. Nesta Dissertação, métodos considerados estado-da-arte para problemas semelhantes encontrados na literatura são selecionados para serem exploradas oportunidades de melhoria. Com foco na simplicidade de implementação e eficiência de execução, diferentes métodos heurísticos são propostos. Experimentos extensivos são realizados para avaliar o desempenho. Os resultados mostram que as heurísticas propostas superam os métodos existentes em qualidade de solução e eficiência computacional.
 
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
2021-12-08
 
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-2022. All rights reserved.