Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/4531
Título: An optimization approach for the job shop scheduling problem
Autor: Magalhães-Mendes, J.
Data: 2009
Editora: World Scientific and Engineering Academy and Society
Relatório da Série N.º: 14th WSEAS International Conference on Applied Mathematics;
Resumo: This paper presents an optimization approach for the job shop scheduling problem (JSSP). The JSSP is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. The proposed approach is based on a genetic algorithm technique. The scheduling rules such as SPT and MWKR are integrated into the process of genetic evolution. The chromosome representation of the problem is based on random keys. The schedules are constructed using a priority rule in which the priorities and delay times of the operations are defined by the genetic algorithm. Schedules are constructed using a procedure that generates parameterized active schedules. After a schedule is obtained a local search heuristic is applied to improve the solution. The approach is tested on a set of standard instances taken from the literature and compared with other approaches. The computation results validate the effectiveness of the proposed approach.
Peer review: yes
URI: http://hdl.handle.net/10400.22/4531
ISBN: 978-960-474-138-0
Versão do Editor: http://dl.acm.org/citation.cfm?id=1736367
Aparece nas colecções:ISEP – CIDEM – Artigos

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
ART_JMagalhaesMendes_2009_CIDEM.pdf95,84 kBAdobe PDFVer/Abrir


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.