A computational study of representations in genetic programming to evolve dispatching rules for the job shop scheduling problem
10.1109/TEVC.2012.2227326
Saved in:
Main Authors: | Nguyen, S., Zhang, M., Johnston, M., Tan, K.C. |
---|---|
Other Authors: | ELECTRICAL & COMPUTER ENGINEERING |
Format: | Article |
Published: |
2014
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/54010 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Dynamic selection of dispatching rules for job shop scheduling
by: Subramaniam, V., et al.
Published: (2014) -
Learning iterative dispatching rules for job shop scheduling with genetic programming
by: Nguyen, S., et al.
Published: (2014) -
Genetic Programming for Evolving Due-Date Assignment Models in Job Shop Environments
by: Nguyen, S., et al.
Published: (2014) -
A Comparison of Job Shop Dispatching Rules Using a Total Cost Criterion
by: Yang, Kum Khiong, et al.
Published: (1994) -
Performance of an ant colony optimisation algorithm in dynamic job shop scheduling problems
by: Zhou, R., et al.
Published: (2014)