![](bg9.png)
REFERENCES
Ak, B. and Koc, E. (2012). A Guide for Genetic Algorithm
Based on Parallel Machine Scheduling and Flexible
Job-Shop Scheduling. Procedia - Social and Behav-
ioral Sciences, 62:817–823.
Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa,
G., Ozcan, E., and Qu, R. (2013). Hyper-heuristics:
a survey of the state of the art. Journal of the Opera-
tional Research Society, 64(12):1695–1724.
Cheng, R., Gen, M., and Tsujimura, Y. (1996). A tutorial
survey of job-shop scheduling problems using genetic
algorithmsI. Representation. Computers & Industrial
Engineering, 30(4):983–997.
Cheng, R., Gen, M., and Tsujimura, Y. (1999). A tutorial
survey of job-shop scheduling problems using genetic
algorithms, part II: hybrid genetic search strategies.
Computers & Industrial Engineering, 36(2):343–364.
Dhingra, A. and Chandna, P. (2010). A bi-criteria M-
machine SDST flow shop scheduling using modified
heuristic genetic algorithm. International Journal of
Engineering, Science and Technology, 2(5):216–225.
Gurobi Optimization, Inc. (2013). Gurobi optimization
(version 5.6.2) [software].
Hansen, N. and Ostermeier, A. (2001). Completely deran-
domized self-adaptation in evolution strategies. Evol.
Comput., 9(2):159–195.
Haupt, R. (1989). A survey of priority rule-based schedul-
ing. OR Spectrum, 11:3–16.
Ingimundardottir, H. and Runarsson, T. P. (2011a). Sam-
pling strategies in ordinal regression for surrogate as-
sisted evolutionary optimization. In Intelligent Sys-
tems Design and Applications (ISDA), 2011 11th In-
ternational Conference on, pages 1158–1163.
Ingimundardottir, H. and Runarsson, T. P. (2011b). Super-
vised learning linear priority dispatch rules for job-
shop scheduling. In Coello, C., editor, Learning
and Intelligent Optimization, volume 6683 of Lecture
Notes in Computer Science, pages 263–277. Springer,
Berlin, Heidelberg.
Ingimundardottir, H. and Runarsson, T. P. (2012). Deter-
mining the characteristic of difficult job shop schedul-
ing instances for a heuristic solution method. In
Hamadi, Y. and Schoenauer, M., editors, Learning and
Intelligent Optimization, Lecture Notes in Computer
Science, pages 408–412. Springer, Berlin, Heidelberg.
Jayamohan, M. and Rajendran, C. (2004). Development
and analysis of cost-based dispatching rules for job
shop scheduling. European Journal of Operational
Research, 157(2):307–321.
Koza, J. R. and Poli, R. (2005). Genetic programming. In
Burke, E. and Kendal, G., editors, Introductory Tutori-
als in Optimization and Decision Support Techniques,
chapter 5. Springer.
Nguyen, S., Zhang, M., Johnston, M., and Tan, K. C.
(2013). Learning iterative dispatching rules for job
shop scheduling with genetic programming. The In-
ternational Journal of Advanced Manufacturing Tech-
nology.
Panwalkar, S. S. and Iskander, W. (1977). A survey of
scheduling rules. Operations Research, 25(1):45–61.
Pinedo, M. L. (2008). Scheduling: Theory, Algorithms, and
Systems. Springer Publishing Company, Incorporated,
3 edition.
Qing-dao-er ji, R. and Wang, Y. (2012). A new hybrid
genetic algorithm for job shop scheduling problem.
Computers & Operations Research, 39(10):2291–
2299.
Rice, J. R. (1976). The algorithm selection problem. Ad-
vances in Computers, 15:65–118.
Smith-Miles, K., James, R., Giffin, J., and Tu, Y. (2009).
A knowledge discovery approach to understanding re-
lationships between scheduling problem structure and
heuristic performance. In Sttzle, T., editor, Learning
and Intelligent Optimization, volume 5851 of Lecture
Notes in Computer Science, pages 89–103. Springer,
Berlin, Heidelberg.
Smith-Miles, K. and Lopes, L. (2011). Generalising algo-
rithm performance in instance space: A timetabling
case study. In Coello, C., editor, Learning and Intel-
ligent Optimization, volume 6683 of Lecture Notes in
Computer Science, pages 524–538. Springer, Berlin,
Heidelberg.
Tay, J. C. and Ho, N. B. (2008). Evolving dispatching
rules using genetic programming for solving multi-
objective flexible job-shop problems. Computers and
Industrial Engineering, 54(3):453–473.
Tsai, J.-T., Liu, T.-K., Ho, W.-H., and Chou, J.-H. (2007).
An improved genetic algorithm for job-shop schedul-
ing problems using Taguchi-based crossover. The In-
ternational Journal of Advanced Manufacturing Tech-
nology, 38(9-10):987–994.
V´azquez-Rodr´ıguez, J. A. and Petrovic, S. (2009). A new
dispatching rule based genetic algorithm for the multi-
objective job shop problem. Journal of Heuristics,
16(6):771–793.
Watson, J.-P., Barbulescu, L., Whitley, L. D., and Howe,
A. E. (2002). Contrasting structured and random
permutation flow-shop scheduling problems: Search-
space topology and algorithm performance. IN-
FORMS Journal on Computing, 14:98–123.
EvolutionaryLearningofWeightedLinearCompositeDispatchingRulesforScheduling
67