Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.ejor.2004.03.012 | European Journal of Operational Research |
Keywords | Field | DocType |
Job shop,Scheduling,Genetic algorithm,Heuristics,Random keys | Mathematical optimization,Heuristic,Job shop scheduling,Computer science,Job shop,Flow shop scheduling,Schedule,Rate-monotonic scheduling,Local search (optimization),Genetic algorithm,Operations management | Journal |
Volume | Issue | ISSN |
167 | 1 | 0377-2217 |
Citations | PageRank | References |
183 | 7.89 | 18 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| José Fernando Gonçalves | 1 | 736 | 37.31 |
| Jorge José De Magalhães Mendes | 2 | 265 | 11.18 |
| Mauricio G. C. Resende | 3 | 3729 | 336.98 |