- No file added yet -
Genetic programming for job shop scheduling
chapter
posted on 2020-10-29, 00:45 authored by S Nguyen, Mengjie ZhangMengjie Zhang, M Johnston, KC Tan© 2019, Springer International Publishing AG, part of Springer Nature. Designing effective scheduling rules or heuristics for a manufacturing system such as job shops is not a trivial task. In the early stage, scheduling experts rely on their experiences to develop dispatching rules and further improve them through trials-and-errors, sometimes with the help of computer simulations. In recent years, automated design approaches have been applied to develop effective dispatching rules for job shop scheduling (JSS). Genetic programming (GP) is currently the most popular approach for this task. The goal of this chapter is to summarise existing studies in this field to provide an overall picture to interested researchers. Then, we demonstrate some recent ideas to enhance the effectiveness of GP for JSS and discuss interesting research topics for future studies.
History
Preferred citation
Nguyen, S., Zhang, M., Johnston, M. & Tan, K. C. (2019). Genetic programming for job shop scheduling. Studies in Computational Intelligence (779, pp. 143-167). Springer International Publishing. https://doi.org/10.1007/978-3-319-91341-4_8Publisher DOI
Book title
Studies in Computational IntelligencePublisher
Springer International PublishingPagination
143-167Volume
779ISBN
9783319913391ISSN
1860-949XUsage metrics
Categories
No categories selectedLicence
Exports
RefWorksRefWorks
BibTeXBibTeX
Ref. managerRef. manager
EndnoteEndnote
DataCiteDataCite
NLMNLM
DCDC