Metaheurísticas para o problema de Flowshop flexível com penalidades de adiantamento e atraso
Autor(a) principal: | |
---|---|
Data de Publicação: | 2011 |
Tipo de documento: | Dissertação |
Idioma: | por |
Título da fonte: | LOCUS Repositório Institucional da UFV |
Texto Completo: | http://locus.ufv.br/handle/123456789/2623 |
Resumo: | This work deals with the problem of job scheduling in flexible flowshop system with the objective of minimizing the penalties for tardiness and earliness in terms of the job due date. It is considered that all jobs are available for processing in different moments, according to them release times, besides that, there are setup times depending on the sequence and stages. The problem addressed belongs to the production programming environment JIT (just-in-time). In this environment, each job has a processing time and due date within which it should preferably be completed, therefore the processing a job should end as closer as possible to its due date. When a job finishes processing earlyth, production is finalized before due date, hence it must be stored, which generates storage costs. When the job is tardy is the job and consequent delay on further productions, causing a chain effect, causing loss of trust from consumer, which has unestimated cost, besides contract fines, which harms the image of an enterprise. In this work it was developed an PLIM for the problem. Due to the problem computational complexity, heuristics and metaheuristic are used for obtaining good quality approximate solutions. Metaheuristics applied are Iterated Local Search (ILS) and Genetic Algorithm (GA): basic genetic algorithm (GA-B) and Genetic Algorithm with local search (GA-LS). The GA-LS is an adaptation of the GA-B with local search, applied for improving a solutions determined by the genetic operators. PLIM model, for of problems smaller size, is solved by using the optimization software CPLEX. Results obtained from the proposed heuristics ILS, AG-B and AG-BL are compared and analyzed among themselves and also with solutions determined by constructive heuristics, MST and NEH-MST, computational tests have shown that metaheuristic ILS obtains solutions of good quality. After adjusting the required parameters and several tests showed that the ILS was the most effective technique for obtaining good quality solutions to the problem studied. |
id |
UFV_5fc9bb94fb9c2d1269c58a3d9678f782 |
---|---|
oai_identifier_str |
oai:locus.ufv.br:123456789/2623 |
network_acronym_str |
UFV |
network_name_str |
LOCUS Repositório Institucional da UFV |
repository_id_str |
2145 |
spelling |
Pereira, Ana Amélia de Souzahttp://lattes.cnpq.br/3232663071892028Arroyo, José Elias Cláudiohttp://buscatextual.cnpq.br/buscatextual/visualizacv.do?id=K4703979J8Rocha, Mauro Nacifhttp://buscatextual.cnpq.br/buscatextual/visualizacv.do?id=K4702810U7Santos, Heleno do Nascimentohttp://buscatextual.cnpq.br/buscatextual/visualizacv.do?id=K4788215Y82015-03-26T13:10:28Z2012-07-182015-03-26T13:10:28Z2011-08-02PEREIRA, Ana Amélia de Souza. Metaheuristics for the flexible Flowshop problem with earliness and tardiness penalties. 2011. 71 f. Dissertação (Mestrado em Metodologias e técnicas da Computação; Sistemas de Computação) - Universidade Federal de Viçosa, Viçosa, 2011.http://locus.ufv.br/handle/123456789/2623This work deals with the problem of job scheduling in flexible flowshop system with the objective of minimizing the penalties for tardiness and earliness in terms of the job due date. It is considered that all jobs are available for processing in different moments, according to them release times, besides that, there are setup times depending on the sequence and stages. The problem addressed belongs to the production programming environment JIT (just-in-time). In this environment, each job has a processing time and due date within which it should preferably be completed, therefore the processing a job should end as closer as possible to its due date. When a job finishes processing earlyth, production is finalized before due date, hence it must be stored, which generates storage costs. When the job is tardy is the job and consequent delay on further productions, causing a chain effect, causing loss of trust from consumer, which has unestimated cost, besides contract fines, which harms the image of an enterprise. In this work it was developed an PLIM for the problem. Due to the problem computational complexity, heuristics and metaheuristic are used for obtaining good quality approximate solutions. Metaheuristics applied are Iterated Local Search (ILS) and Genetic Algorithm (GA): basic genetic algorithm (GA-B) and Genetic Algorithm with local search (GA-LS). The GA-LS is an adaptation of the GA-B with local search, applied for improving a solutions determined by the genetic operators. PLIM model, for of problems smaller size, is solved by using the optimization software CPLEX. Results obtained from the proposed heuristics ILS, AG-B and AG-BL are compared and analyzed among themselves and also with solutions determined by constructive heuristics, MST and NEH-MST, computational tests have shown that metaheuristic ILS obtains solutions of good quality. After adjusting the required parameters and several tests showed that the ILS was the most effective technique for obtaining good quality solutions to the problem studied.Este trabalho aborda o problema da programação de tarefas num sistema flowshop flexível, com o objetivo de minimizar penalidades por adiantamentos e atrasos em relação às datas de entrega das tarefas. Considera-se que todas as tarefas estão disponíveis para processamento em diferentes instantes, conforme suas datas de liberação (release time), além disso, existem tempos de preparação (setup times) dependentes da sequência e dos estágios. O problema abordado pertence ao ambiente de programação da produção JIT (just-in-time). Neste ambiente, o processamento de uma tarefa deve ser finalizado o mais próximo possível da sua data de entrega. Quando ocorre o adiantamento no processamento da tarefa, a produção é finalizada antes da data de entrega, devendo então ser armazenada, o que gera custos de estocagem. Já com o atraso na cadeia produtiva, ocorre o custo de atraso da tarefa e consequen te atraso das demais produções, ocasionando um efeito em cadeia, além da perda de confiança por parte do consumidor, fator este de custo inestimável, além do pagamento de multas contratuais, o que prejudica a imagem de uma empresa. Neste trabalho foi desenvolvido um modelo de programação inteira mista (PLIM) para o problema. Devido à complexidade computacional do problema, são utilizadas heurísticas e metaheurísticas para a obtenção de soluções aproximadas de boa qualidade. As metaheurísticas aplicadas são Iterated Local Search (ILS) e Algoritmo Genético (AG): Algoritmo Genético básico (AG-B) e Algoritmo Genético com busca local (AG-BL). O AG-BL é uma adaptação do algoritmo genético básico com busca local, aplicada para melhorar soluções determinadas pelos operadores genéticos. O modelo de PLIM, para problemas de pequeno porte, é resolvido utilizando o software de otimização CPLEX. Os resultados das metaheurísticas propostas ILS, AG-B e AG-BL são comparados e analisados entre si e também com as soluções determinadas por duas heurísticas construtivas, MST e NEH-MST. Após os ajustes dos parâmetros necessários e diversos testes, observou-se que a metaheurística ILS foi à técnica mais eficiente para obter soluções de boa qualidade para o problema estudado.application/pdfporUniversidade Federal de ViçosaMestrado em Ciência da ComputaçãoUFVBRMetodologias e técnicas da Computação; Sistemas de ComputaçãoProgramação de tarefasMetaheurísticasOtimização combinatóriaJob schedulingMetaheuristicsCombinatorial optimizationCNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAOMetaheurísticas para o problema de Flowshop flexível com penalidades de adiantamento e atrasoMetaheuristics for the flexible Flowshop problem with earliness and tardiness penaltiesinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/masterThesisinfo:eu-repo/semantics/openAccessreponame:LOCUS Repositório Institucional da UFVinstname:Universidade Federal de Viçosa (UFV)instacron:UFVORIGINALtexto completo.pdfapplication/pdf1455781https://locus.ufv.br//bitstream/123456789/2623/1/texto%20completo.pdfd686b8a1fc31adcbe1ad4c59ea5946b3MD51TEXTtexto completo.pdf.txttexto completo.pdf.txtExtracted texttext/plain118131https://locus.ufv.br//bitstream/123456789/2623/2/texto%20completo.pdf.txtc308d342d35b5cfaa04fd0bd4cb4a4b8MD52THUMBNAILtexto completo.pdf.jpgtexto completo.pdf.jpgIM Thumbnailimage/jpeg3581https://locus.ufv.br//bitstream/123456789/2623/3/texto%20completo.pdf.jpg897504c4582f407bb1dc375c34a5b924MD53123456789/26232016-04-08 23:10:25.107oai:locus.ufv.br:123456789/2623Repositório InstitucionalPUBhttps://www.locus.ufv.br/oai/requestfabiojreis@ufv.bropendoar:21452016-04-09T02:10:25LOCUS Repositório Institucional da UFV - Universidade Federal de Viçosa (UFV)false |
dc.title.por.fl_str_mv |
Metaheurísticas para o problema de Flowshop flexível com penalidades de adiantamento e atraso |
dc.title.alternative.eng.fl_str_mv |
Metaheuristics for the flexible Flowshop problem with earliness and tardiness penalties |
title |
Metaheurísticas para o problema de Flowshop flexível com penalidades de adiantamento e atraso |
spellingShingle |
Metaheurísticas para o problema de Flowshop flexível com penalidades de adiantamento e atraso Pereira, Ana Amélia de Souza Programação de tarefas Metaheurísticas Otimização combinatória Job scheduling Metaheuristics Combinatorial optimization CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
title_short |
Metaheurísticas para o problema de Flowshop flexível com penalidades de adiantamento e atraso |
title_full |
Metaheurísticas para o problema de Flowshop flexível com penalidades de adiantamento e atraso |
title_fullStr |
Metaheurísticas para o problema de Flowshop flexível com penalidades de adiantamento e atraso |
title_full_unstemmed |
Metaheurísticas para o problema de Flowshop flexível com penalidades de adiantamento e atraso |
title_sort |
Metaheurísticas para o problema de Flowshop flexível com penalidades de adiantamento e atraso |
author |
Pereira, Ana Amélia de Souza |
author_facet |
Pereira, Ana Amélia de Souza |
author_role |
author |
dc.contributor.authorLattes.por.fl_str_mv |
http://lattes.cnpq.br/3232663071892028 |
dc.contributor.author.fl_str_mv |
Pereira, Ana Amélia de Souza |
dc.contributor.advisor1.fl_str_mv |
Arroyo, José Elias Cláudio |
dc.contributor.advisor1Lattes.fl_str_mv |
http://buscatextual.cnpq.br/buscatextual/visualizacv.do?id=K4703979J8 |
dc.contributor.referee1.fl_str_mv |
Rocha, Mauro Nacif |
dc.contributor.referee1Lattes.fl_str_mv |
http://buscatextual.cnpq.br/buscatextual/visualizacv.do?id=K4702810U7 |
dc.contributor.referee2.fl_str_mv |
Santos, Heleno do Nascimento |
dc.contributor.referee2Lattes.fl_str_mv |
http://buscatextual.cnpq.br/buscatextual/visualizacv.do?id=K4788215Y8 |
contributor_str_mv |
Arroyo, José Elias Cláudio Rocha, Mauro Nacif Santos, Heleno do Nascimento |
dc.subject.por.fl_str_mv |
Programação de tarefas Metaheurísticas Otimização combinatória |
topic |
Programação de tarefas Metaheurísticas Otimização combinatória Job scheduling Metaheuristics Combinatorial optimization CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
dc.subject.eng.fl_str_mv |
Job scheduling Metaheuristics Combinatorial optimization |
dc.subject.cnpq.fl_str_mv |
CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
description |
This work deals with the problem of job scheduling in flexible flowshop system with the objective of minimizing the penalties for tardiness and earliness in terms of the job due date. It is considered that all jobs are available for processing in different moments, according to them release times, besides that, there are setup times depending on the sequence and stages. The problem addressed belongs to the production programming environment JIT (just-in-time). In this environment, each job has a processing time and due date within which it should preferably be completed, therefore the processing a job should end as closer as possible to its due date. When a job finishes processing earlyth, production is finalized before due date, hence it must be stored, which generates storage costs. When the job is tardy is the job and consequent delay on further productions, causing a chain effect, causing loss of trust from consumer, which has unestimated cost, besides contract fines, which harms the image of an enterprise. In this work it was developed an PLIM for the problem. Due to the problem computational complexity, heuristics and metaheuristic are used for obtaining good quality approximate solutions. Metaheuristics applied are Iterated Local Search (ILS) and Genetic Algorithm (GA): basic genetic algorithm (GA-B) and Genetic Algorithm with local search (GA-LS). The GA-LS is an adaptation of the GA-B with local search, applied for improving a solutions determined by the genetic operators. PLIM model, for of problems smaller size, is solved by using the optimization software CPLEX. Results obtained from the proposed heuristics ILS, AG-B and AG-BL are compared and analyzed among themselves and also with solutions determined by constructive heuristics, MST and NEH-MST, computational tests have shown that metaheuristic ILS obtains solutions of good quality. After adjusting the required parameters and several tests showed that the ILS was the most effective technique for obtaining good quality solutions to the problem studied. |
publishDate |
2011 |
dc.date.issued.fl_str_mv |
2011-08-02 |
dc.date.available.fl_str_mv |
2012-07-18 2015-03-26T13:10:28Z |
dc.date.accessioned.fl_str_mv |
2015-03-26T13:10:28Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/masterThesis |
format |
masterThesis |
status_str |
publishedVersion |
dc.identifier.citation.fl_str_mv |
PEREIRA, Ana Amélia de Souza. Metaheuristics for the flexible Flowshop problem with earliness and tardiness penalties. 2011. 71 f. Dissertação (Mestrado em Metodologias e técnicas da Computação; Sistemas de Computação) - Universidade Federal de Viçosa, Viçosa, 2011. |
dc.identifier.uri.fl_str_mv |
http://locus.ufv.br/handle/123456789/2623 |
identifier_str_mv |
PEREIRA, Ana Amélia de Souza. Metaheuristics for the flexible Flowshop problem with earliness and tardiness penalties. 2011. 71 f. Dissertação (Mestrado em Metodologias e técnicas da Computação; Sistemas de Computação) - Universidade Federal de Viçosa, Viçosa, 2011. |
url |
http://locus.ufv.br/handle/123456789/2623 |
dc.language.iso.fl_str_mv |
por |
language |
por |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Universidade Federal de Viçosa |
dc.publisher.program.fl_str_mv |
Mestrado em Ciência da Computação |
dc.publisher.initials.fl_str_mv |
UFV |
dc.publisher.country.fl_str_mv |
BR |
dc.publisher.department.fl_str_mv |
Metodologias e técnicas da Computação; Sistemas de Computação |
publisher.none.fl_str_mv |
Universidade Federal de Viçosa |
dc.source.none.fl_str_mv |
reponame:LOCUS Repositório Institucional da UFV instname:Universidade Federal de Viçosa (UFV) instacron:UFV |
instname_str |
Universidade Federal de Viçosa (UFV) |
instacron_str |
UFV |
institution |
UFV |
reponame_str |
LOCUS Repositório Institucional da UFV |
collection |
LOCUS Repositório Institucional da UFV |
bitstream.url.fl_str_mv |
https://locus.ufv.br//bitstream/123456789/2623/1/texto%20completo.pdf https://locus.ufv.br//bitstream/123456789/2623/2/texto%20completo.pdf.txt https://locus.ufv.br//bitstream/123456789/2623/3/texto%20completo.pdf.jpg |
bitstream.checksum.fl_str_mv |
d686b8a1fc31adcbe1ad4c59ea5946b3 c308d342d35b5cfaa04fd0bd4cb4a4b8 897504c4582f407bb1dc375c34a5b924 |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 |
repository.name.fl_str_mv |
LOCUS Repositório Institucional da UFV - Universidade Federal de Viçosa (UFV) |
repository.mail.fl_str_mv |
fabiojreis@ufv.br |
_version_ |
1801213076551237632 |