Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/91225
Type: Artigo de evento
Title: A Multi-agents Approach To Solve Job Shop Scheduling Problems Using Meta-heuristics
Author: Passos C.A.S.
Iha V.M.
Dominiquini R.B.
Abstract: This paper presents a multi-agents approach to solve job shop scheduling problem using metaheuristics. The job shop scheduling problem (JSP) is a traditional problem largely exploited in the operational research area through the academic research but belonging also to the domain of practical situations, especially in industrial companies. Several approaches have been used to investigate this problem that is very complex when addressing real industrial cases. The JSP is a NP-hard problem and no exact solution can be obtained in polynomial time. Meta-heuristics approaches when solving scheduling problems have proven to be very effective and useful in practical situations. Among them, Tabu Search (TS) and Genetic Algorithms (GA) have been used to solve optimization problems with success. The main reason is that these algorithms have good performance in terms of solution quality and execution time, when compared with optimization or simple heuristics techniques respectively. In this sense, the multi-agent approach proposed in this paper combining these algorithms brings new perspective to solve this kind of problem. In this paper a multi-agent approach based on A-Team that combines TS and GA and other specific agents is presented to solve the JSP. Results for benchmark problems from the literature are presented aiming to demonstrate the applicability of the proposal. © 2010 IFAC.
Editor: 
Rights: fechado
Identifier DOI: 10.3182/20100908-3-PT-3007.00037
Address: http://www.scopus.com/inward/record.url?eid=2-s2.0-80051957025&partnerID=40&md5=f6b8ccf42e22b3d0b9ca6ddc78f803a5
Date Issue: 2010
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.