Evolutionary computation algorithms for feature selection of EEG-based emotion recognition using mobile sensors
There is currently no standard or widely accepted subset of features to effectively classify
different emotions based on electroencephalogram (EEG) signals. While combining all …
different emotions based on electroencephalogram (EEG) signals. While combining all …
Adapted techniques of explainable artificial intelligence for explaining genetic algorithms on the example of job scheduling
YC Wang, T Chen - Expert Systems with Applications, 2024 - Elsevier
Many evolutionary artificial intelligence (AI) technologies have been applied to assist with
job scheduling in manufacturing. One of the main approaches is genetic algorithms (GAs) …
job scheduling in manufacturing. One of the main approaches is genetic algorithms (GAs) …
Multiobjective simulated annealing: Principles and algorithm variants
K Amine - Advances in Operations Research, 2019 - Wiley Online Library
Simulated annealing is a stochastic local search method, initially introduced for global
combinatorial mono‐objective optimisation problems, allowing gradual convergence to a …
combinatorial mono‐objective optimisation problems, allowing gradual convergence to a …
An efficient job-shop scheduling algorithm based on particle swarm optimization
TL Lin, SJ Horng, TW Kao, YH Chen, RS Run… - Expert Systems with …, 2010 - Elsevier
The job-shop scheduling problem has attracted many researchers' attention in the past few
decades, and many algorithms based on heuristic algorithms, genetic algorithms, and …
decades, and many algorithms based on heuristic algorithms, genetic algorithms, and …
A state of the art review of intelligent scheduling
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 …
solving the scheduling problems. In this paper, we provide a survey of intelligent scheduling …
A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems
This paper presents a novel discrete differential evolution (DDE) algorithm for solving the no-
wait flow shop scheduling problems with makespan and maximum tardiness criteria. First …
wait flow shop scheduling problems with makespan and maximum tardiness criteria. First …
A multi-objective PSO for job-shop scheduling problems
DY Sha, HH Lin - Expert Systems with Applications, 2010 - Elsevier
Most previous research into the job-shop scheduling problem has concentrated on finding a
single optimal solution (eg, makespan), even though the actual requirement of most …
single optimal solution (eg, makespan), even though the actual requirement of most …
Multi-objective production scheduling: a survey
D Lei - The International Journal of Advanced Manufacturing …, 2009 - Springer
The real life scheduling problems often have several conflicting objectives. The solutions of
these problems can provide deeper insights to the decision maker than those of single …
these problems can provide deeper insights to the decision maker than those of single …
A new hybrid multi-objective Pareto archive PSO algorithm for a bi-objective job shop scheduling problem
R Tavakkoli-Moghaddam, M Azarkish… - Expert systems with …, 2011 - Elsevier
This paper presents a new mathematical model for a bi-objective job shop scheduling
problem with sequence-dependent setup times and ready times that minimizes the weighted …
problem with sequence-dependent setup times and ready times that minimizes the weighted …
Explainable artificial intelligence (XAI) in manufacturing
TCT Chen - … Intelligence (XAI) in Manufacturing: Methodology, Tools …, 2023 - Springer
This chapter begins by defining explainable artificial intelligence (XAI). A procedure for
implementing XAI was also established. Then, through literature analysis, the application of …
implementing XAI was also established. Then, through literature analysis, the application of …