Graph-based modeling in shop scheduling problems: Review and extensions
Graphs are powerful tools to model manufacturing systems and scheduling problems. The
complexity of these systems and their scheduling problems has been substantially …
complexity of these systems and their scheduling problems has been substantially …
Contribution-based cooperative co-evolution for nonseparable large-scale problems with overlapping subcomponents
Cooperative co-evolutionary algorithms have addressed many large-scale problems
successfully, but the nonseparable large-scale problems with overlapping subcomponents …
successfully, but the nonseparable large-scale problems with overlapping subcomponents …
Cooperative coevolutionary CMA-ES with landscape-aware grouping in noisy environments
Many real-world optimization tasks suffer from noise. So far, the research on noise-tolerant
optimization algorithms is still restricted to low-dimensional problems with less than 100 …
optimization algorithms is still restricted to low-dimensional problems with less than 100 …
Cooperative co-evolution for feature selection in Big Data with random feature grouping
A massive amount of data is generated with the evolution of modern technologies. This high-
throughput data generation results in Big Data, which consist of many features (attributes) …
throughput data generation results in Big Data, which consist of many features (attributes) …
Apply ordinal optimization to optimize the job-shop scheduling under uncertain processing times
SC Horng, SS Lin - Arabian Journal for Science and Engineering, 2022 - Springer
The job shop scheduling problem is generally divided into two types according to production
environments, the job shop scheduling problem with deterministic processing times and the …
environments, the job shop scheduling problem with deterministic processing times and the …
A simheuristic approach using the NSGA-II to solve a bi-objective stochastic flexible job shop problem
CA Rodríguez-Espinosa, EM González-Neira… - Journal of …, 2023 - Taylor & Francis
This paper addresses a bi-objective problem in flexible job shop scheduling (FJSS) with
stochastic processing times. Following the Just-In-Time philosophy, the first objective is to …
stochastic processing times. Following the Just-In-Time philosophy, the first objective is to …
Dragonfly visual evolutionary neural network: A novel bionic optimizer with related LSGO and engineering design optimization
H Wang, Z Zhang - Iscience, 2024 - cell.com
Biological visual systems intrinsically include multiple kinds of motion-sensitive neurons.
Some of them have been successfully used to construct neural computational models for …
Some of them have been successfully used to construct neural computational models for …
A meta-model-based multi-objective evolutionary approach to robust job shop scheduling
In the real-world manufacturing system, various uncertain events can occur and disrupt the
normal production activities. This paper addresses the multi-objective job shop scheduling …
normal production activities. This paper addresses the multi-objective job shop scheduling …
Mathematical model and evaluation function for conflict-free warranted makespan minimization of mixed blocking constraint job-shop problems
C Sauvey, W Trabelsi, N Sauer - Mathematics, 2020 - mdpi.com
In this paper, we consider a job-shop scheduling problem with mixed blocking constraints.
Contrary to most previous studies, where no blocking or only one type of blocking constraint …
Contrary to most previous studies, where no blocking or only one type of blocking constraint …
Job shop scheduling with AGVs under variable processing time
In this paper, a job shop scheduling problem with material handling (JSSMH) is analysed
given variable job processing time. The material handling is conducted by automatic guided …
given variable job processing time. The material handling is conducted by automatic guided …