Automated design of production scheduling heuristics: A review

J Branke, S Nguyen, CW Pickardt… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
Hyper-heuristics have recently emerged as a powerful approach to automate the design of
heuristics for a number of different problems. Production scheduling is a particularly popular …

Genetic programming for production scheduling: a survey with a unified framework

S Nguyen, Y Mei, M Zhang - Complex & Intelligent Systems, 2017 - Springer
Genetic programming has been a powerful technique for automated design of production
scheduling heuristics. Many studies have shown that heuristics evolved by genetic …

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 …

[PDF][PDF] A priority based job scheduling algorithm in cloud computing

S Ghanbari, M Othman - Procedia Engineering, 2012 - researchgate.net
Nowadays cloud computing has become a popular platform for scientific applications. Cloud
computing intends to share a large scale resources and equipments of computation …

Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints

H Fan, H Xiong, M Goh - Computers & Operations Research, 2021 - Elsevier
Extended technical precedence constraints (ETPC) in dynamic job shop scheduling problem
(DJSP) are the precedence constraints existing between different jobs instead of the …

An efficient feature selection algorithm for evolving job shop scheduling rules with genetic programming

Y Mei, S Nguyen, B Xue… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
Automated design of job shop scheduling rules using genetic programming as a hyper-
heuristic is an emerging topic that has become more and more popular in recent years. For …

Genetic programming with local search to evolve priority rules for scheduling jobs on a machine with time-varying capacity

FJ Gil-Gala, MR Sierra, C Mencía, R Varela - Swarm and Evolutionary …, 2021 - Elsevier
Priority rules combined with schedule generation schemes are a usual approach to online
scheduling. These rules are commonly designed by experts on the problem domain …

Adaptive scheduling on unrelated machines with genetic programming

M Đurasević, D Jakobović, K Knežević - Applied Soft Computing, 2016 - Elsevier
This paper investigates the use of genetic programming in automatized synthesis of
heuristics for the parallel unrelated machines environment with arbitrary performance …

[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 …