dc.contributorKato, Edilson Reis Rodrigues
dc.contributorhttp://lattes.cnpq.br/8517698122676145
dc.contributorhttp://lattes.cnpq.br/4992244482206844
dc.creatorFlorêncio, Guilherme Felipe
dc.date.accessioned2019-09-06T19:16:43Z
dc.date.accessioned2022-10-10T21:29:00Z
dc.date.available2019-09-06T19:16:43Z
dc.date.available2022-10-10T21:29:00Z
dc.date.created2019-09-06T19:16:43Z
dc.date.issued2019-02-25
dc.identifierFLORÊNCIO, Guilherme Felipe. Algoritmo baseado em colônia de abelhas artificiais para resolução do problema de programação de um job shop flexível multiobjetivo. 2019. Dissertação (Mestrado em Ciência da Computação) – Universidade Federal de São Carlos, São Carlos, 2019. Disponível em: https://repositorio.ufscar.br/handle/ufscar/11793.
dc.identifierhttps://repositorio.ufscar.br/handle/ufscar/11793
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/4042308
dc.description.abstractThe flexible job shop problem (FJSP), considered one of the most complex problems of work scheduling, composes the class of NP-hard problems in the computer science field. Although this scheduling production problem is quite complex, it can be computationally more costly to be treated when additional restrictions or criteria are imposed to the problem. The FJSP consists in a set of "n" job that are constituted by "i" operations, and these operations are processed individually by a machine 'M' that is part of the production environment machine set. In this type of system, each operation inside the job can be processed at a different machine. On the fully flexible process, all the machines are able to process all the operations, and on the partly flexible, at least one does not process at least one operation. This problem can be divided into two sub-problems, the routing and the scheduling. The routing consists in to define which machine will process the operation, and the scheduling consists in the order that operations will be processed. Through this work, it has been aimed to minimize performance multiobjectives, such as: makespan, more loaded machine load and full load of all machines, seeking high diversity of solutions. To achieve the objectives of this paper it was implemented the metaheuristic Artificial Bee Colony along with the Pareto method to help treating the multiobjectives. The observed results were satisfactory in most instances for which the algorithm was applied, and optimal results were found for some instances.
dc.languagepor
dc.publisherUniversidade Federal de São Carlos
dc.publisherUFSCar
dc.publisherPrograma de Pós-Graduação em Ciência da Computação - PPGCC
dc.publisherCâmpus São Carlos
dc.rightsAcesso aberto
dc.subjectProgramação da produção
dc.subjectMultiobjetivo
dc.subjectColônia de abelhas artificiais
dc.subjectPareto
dc.subjectProduction program
dc.subjectMultiobjective
dc.subjectArtificial bee colony
dc.subjectFlexible job shop problem (FJSP)
dc.titleAlgoritmo baseado em colônia de abelhas artificiais para resolução do problema de programação de um job shop flexível multiobjetivo
dc.typeTesis


Este ítem pertenece a la siguiente institución