A state of the art review of intelligent scheduling

MH Fazel Zarandi, AA Sadat Asl, S Sotudian… - Artificial Intelligence …, 2020 - Springer
Intelligent scheduling covers various tools and techniques for successfully and efficiently
solving the scheduling problems. In this paper, we provide a survey of intelligent scheduling …

Genetic algorithms for planning and scheduling engineer-to-order production: a systematic review

A Neumann, A Hajji, M Rekik… - International Journal of …, 2024 - Taylor & Francis
This paper provides a systematic review of the Genetic Algorithm (GA) s proposed to solve
planning and scheduling problems in Engineer-To-Order (ETO) contexts. Our review …

Research on adaptive job shop scheduling problems based on dueling double DQN

BA Han, JJ Yang - Ieee Access, 2020 - ieeexplore.ieee.org
Traditional approaches for job shop scheduling problems are ill-suited to deal with complex
and changeable production environments due to their limited real-time responsiveness …

An effective architecture for learning and evolving flexible job-shop schedules

NB Ho, JC Tay, EMK Lai - European Journal of Operational Research, 2007 - Elsevier
In recent years, the interaction between evolution and learning has received much attention
from the research community. Some recent studies on machine learning have shown that it …

Bi-objective optimization research on integrated fixed time interval preventive maintenance and production for scheduling flexible job-shop problem

E Moradi, SMTF Ghomi, M Zandieh - Expert systems with applications, 2011 - Elsevier
This paper investigates integrated flexible job shop problem (FJSP) with preventive
maintenance (PM) activities under the multi-objective optimization approaches. Finding …

GENACE: an efficient cultural algorithm for solving the flexible job-shop problem

NB Ho, JC Tay - Proceedings of the 2004 Congress on …, 2004 - ieeexplore.ieee.org
This work presents an efficient methodology called GENACE for solving the flexible job-shop
scheduling problem (or FJSP) with recirculation. We show how CDRs are used to solve the …

Genetic tabu search for the fuzzy flexible job shop problem

JJ Palacios, MA González, CR Vela… - Computers & Operations …, 2015 - Elsevier
This paper tackles the flexible job-shop scheduling problem with uncertain processing times.
The uncertainty in processing times is represented by means of fuzzy numbers, hence the …

An effective genetic algorithm for flexible job-shop scheduling with overlapping in operations

Y Demir, SK İşleyen - International Journal of Production Research, 2014 - Taylor & Francis
Flexible job-shop scheduling problem (FJSP) is extension of job-shop scheduling problem
which allows an operation to be performed by any machine among a set of available …

A hybrid immune simulated annealing algorithm for the job shop scheduling problem

R Zhang, C Wu - Applied Soft Computing, 2010 - Elsevier
A hybrid simulated annealing algorithm based on a novel immune mechanism is proposed
for the job shop scheduling problem with the objective of minimizing total weighted …

[HTML][HTML] Quantum circuit compilation by genetic algorithm for quantum approximate optimization algorithm applied to maxcut problem

L Arufe, MA González, A Oddi, R Rasconi… - Swarm and Evolutionary …, 2022 - Elsevier
Abstract The Quantum Circuit Compilation Problem (QCCP) is challenging to the Artificial
Intelligence community. It was already tackled with temporal planning, constraint …