Learning iterative dispatching rules for job shop scheduling with genetic programming
10.1007/s00170-013-4756-9
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/56477 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
A computational study of representations in genetic programming to evolve dispatching rules for the job shop scheduling problem
by: Nguyen, S., et al.
Published: (2014) -
Dynamic selection of dispatching rules for job shop scheduling
by: Subramaniam, V., 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) -
Job shop scheduling to minimize work-in-process, earliness and tardiness costs
by: ZHU ZHECHENG
Published: (2010)