Survey on genetic programming and machine learning techniques for heuristic design in job shop scheduling

F Zhang, Y Mei, S Nguyen… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
Job shop scheduling (JSS) is a process of optimizing the use of limited resources to improve
the production efficiency. JSS has a wide range of applications, such as order picking in the …

Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: a survey

M Ɖurasević, D Jakobović - Artificial Intelligence Review, 2023 - Springer
Scheduling has an immense effect on various areas of human lives, be it though its
application in manufacturing and production industry, transportation, workforce allocation, or …

Evolutionary ensemble learning

MI Heywood - Handbook of Evolutionary Machine Learning, 2023 - Springer
Abstract Evolutionary Ensemble Learning (EEL) provides a general approach for scaling
evolutionary learning algorithms to increasingly complex tasks. This is generally achieved …

Automatic design of scheduling policies for dynamic flexible job shop scheduling via surrogate-assisted cooperative co-evolution genetic programming

Y Zhou, J Yang, Z Huang - International Journal of Production …, 2020 - Taylor & Francis
At present, a lot of references use discrete event simulation to evaluate the fitness of evolved
rules, but which simulation configuration can achieve better evolutionary rules in a limited …

[HTML][HTML] Ensembles of priority rules to solve one machine scheduling problem in real-time

FJ Gil-Gala, M Đurasević, R Varela, D Jakobović - Information sciences, 2023 - Elsevier
Priority rules are one of the most common and popular approaches to real-time scheduling.
Over the last decades, several methods have been developed to generate rules …

Ensembles of priority rules for resource constrained project scheduling problem

M Đumić, D Jakobović - Applied Soft Computing, 2021 - Elsevier
Resource constrained project scheduling problem is an NP-hard problem that attracts many
researchers because of its complexity and daily use. In literature there are a lot of various …

Designing dispatching rules with genetic programming for the unrelated machines environment with constraints

K Jaklinović, M Ðurasević, D Jakobović - Expert Systems with Applications, 2021 - Elsevier
Scheduling problems constitute an important part in many everyday systems, where a
variety of constraints have to be met to ensure the feasibility of schedules. These problems …

Automated design of heuristics for the container relocation problem using genetic programming

M Đurasević, M Đumić - Applied Soft Computing, 2022 - Elsevier
The container relocation problem is a challenging combinatorial optimisation problem
tasked with finding a sequence of container relocations required to retrieve all containers by …

Extracting priority rules for dynamic multi-objective flexible job shop scheduling problems using gene expression programming

G Ozturk, O Bahadir, A Teymourifar - International Journal of …, 2019 - Taylor & Francis
In this paper, two new approaches are proposed for extracting composite priority rules for
scheduling problems. The suggested approaches use simulation and gene expression …

Genetic programming for dynamic flexible job shop scheduling: Evolution with single individuals and ensembles

M Xu, Y Mei, F Zhang, M Zhang - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
Dynamic flexible job shop scheduling is an important but difficult combinatorial optimisation
problem that has numerous real-world applications. Genetic programming has been widely …