Towards Interpretable Dispatching Rules: Application of Expression Simplification Methods-Reference-Cited by-同舟云学术

Towards Interpretable Dispatching Rules: Application of Expression Simplification Methods

Published:2021-12-05 Issue: Volume: Page:
ISSN:
Container-title:2021 IEEE Symposium Series on Computational Intelligence (SSCI)
language:
Short-container-title:

Author:

Planinic Lucija,Durasevic Marko,Jakobovic Domagoj

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/9659537/9659538/09659842.pdf?arnumber=9659842

Reference30 articles.

1. Patterns and pattern-matching in trees: An analysis

2. Evolving dispatching rules for optimising many-objective criteria in the unrelated machines environment;durasevi?;Genetic Programming and Evolvable Machines,2017

3. Evolving Dispatching Rules for Multi-objective Dynamic Flexible Job Shop Scheduling via Genetic Programming Hyper-heuristics

4. Comparison of ensemble learning methods for creating ensembles of dispatching rules for the unrelated machines environment

5. An investigation of ensemble combination schemes for genetic programming based hyper-heuristic approaches to dynamic job shop scheduling

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Further Investigation to Improve Linear Genetic Programming in Dynamic Job Shop Scheduling;2022 IEEE Symposium Series on Computational Intelligence (SSCI);2022-12-04

2. Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: a survey;Artificial Intelligence Review;2022-08-25

3. Introduction to automated design of scheduling heuristics with genetic programming;Proceedings of the Genetic and Evolutionary Computation Conference Companion;2022-07-09