A Hybrid Genetic Algorithm for the Job Shop Scheduling Problem

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...

Full description

Bibliographic Details
Main Author: Gonçalves, José Fernando (author)
Other Authors: Mendes, J. J. M. (author), Resende, Maurício G. C. (author)
Format: article
Language:eng
Published: 2017
Subjects:
Job Shop
Scheduling
Genetic Algorithm
Heuristics
Random Keys
Online Access:http://hdl.handle.net/10400.22/10058
Country:Portugal
Oai:oai:recipp.ipp.pt:10400.22/10058

Internet

http://hdl.handle.net/10400.22/10058

Similar Items