Please use this identifier to cite or link to this item:
|Title:||A computational study of representations in genetic programming to evolve dispatching rules for the job shop scheduling problem||Authors:||Nguyen, S.
Job shop scheduling (JSP)
|Issue Date:||2013||Citation:||Nguyen, S., Zhang, M., Johnston, M., Tan, K.C. (2013). A computational study of representations in genetic programming to evolve dispatching rules for the job shop scheduling problem. IEEE Transactions on Evolutionary Computation 17 (5) : 621-639. ScholarBank@NUS Repository. https://doi.org/10.1109/TEVC.2012.2227326||Abstract:||Designing effective dispatching rules is an important factor for many manufacturing systems. However, this time-consuming process has been performed manually for a very long time. Recently, some machine learning approaches have been proposed to support this task. In this paper, we investigate the use of genetic programming for automatically discovering new dispatching rules for the single objective job shop scheduling problem (JSP). Different representations of the dispatching rules in the literature are newly proposed in this paper and are compared and analysed. Experimental results show that the representation that integrates system and machine attributes can improve the quality of the evolved rules. Analysis of the evolved rules also provides useful knowledge about how these rules can effectively solve JSP. © 1997-2012 IEEE.||Source Title:||IEEE Transactions on Evolutionary Computation||URI:||http://scholarbank.nus.edu.sg/handle/10635/54010||ISSN:||1089778X||DOI:||10.1109/TEVC.2012.2227326|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.