Publication
A Hybrid Genetic Algorithm for the Job Shop Scheduling Problem
| dc.contributor.author | Gonçalves, José Fernando | |
| dc.contributor.author | Mendes, J. J. M. | |
| dc.contributor.author | Resende, Maurício G. C. | |
| dc.date.accessioned | 2017-07-13T13:51:17Z | |
| dc.date.available | 2017-07-13T13:51:17Z | |
| dc.date.issued | 2005 | |
| dc.description.abstract | This paper presents a hybrid genetic algorithm for the Job Shop Scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a priority rule in which the priorities 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 algorithm. | pt_PT |
| dc.description.version | info:eu-repo/semantics/publishedVersion | pt_PT |
| dc.identifier.doi | 10.1016/j.ejor.2004.03.012 | pt_PT |
| dc.identifier.uri | http://hdl.handle.net/10400.22/10058 | |
| dc.language.iso | eng | pt_PT |
| dc.publisher | Elsevier | pt_PT |
| dc.relation.publisherversion | http://www.sciencedirect.com/science/article/pii/S0377221704002656 | pt_PT |
| dc.subject | Job Shop | pt_PT |
| dc.subject | Scheduling | pt_PT |
| dc.subject | Genetic Algorithm | pt_PT |
| dc.subject | Heuristics | pt_PT |
| dc.subject | Random Keys | pt_PT |
| dc.title | A Hybrid Genetic Algorithm for the Job Shop Scheduling Problem | pt_PT |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| oaire.citation.title | European Journal of Operational Research | pt_PT |
| rcaap.rights | openAccess | pt_PT |
| rcaap.type | article | pt_PT |