Please use this identifier to cite or link to this item:
|Title:||Dynamic multi-objective job shop scheduling: A genetic programming approach|
|Citation:||Nguyen, S.,Zhang, M.,Johnston, M.,Tan, K.C. (2013). Dynamic multi-objective job shop scheduling: A genetic programming approach. Studies in Computational Intelligence 505 : 251-282. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-39304-4-10|
|Abstract:||Handling multiple conflicting objectives in dynamic job shop scheduling is challenging because many aspects of the problem need to be considered when designing dispatching rules. A multi-objective genetic programming based hyperheuristic (MO-GPHH) method is investigated here to facilitate the designing task. The goal of this method is to evolve a Pareto front of non-dominated dispatching rules which can be used to support the decision makers by providing them with potential trade-offs among different objectives. The experimental results under different shop conditions suggest that the evolved Pareto front contains very effective rules. Some extensive analyses are also presented to help confirm the quality of the evolved rules. The Pareto front obtained can cover a much wider ranges of rules as compared to a large number of dispatching rules reported in the literature.Moreover, it is also shown that the evolved rules are robust across different shop conditions. © 2013 Springer-Verlag Berlin Heidelberg.|
|Source Title:||Studies in Computational Intelligence|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 10, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.