As a typical combinational optimization problem, the scheduling problem widely exists in
many real-world manufacturing industry applications. With the intensification of marketing …

Flexible job-shop scheduling problem (FJSP) is one of the most important optimization
problem in manufacturing domain. With the development of manufacturing industry, the …

This paper proposes hybrid differential evolution (HDE) algorithms for solving the flexible job
shop scheduling problem (FJSP) with the criterion to minimize the makespan. Firstly, a novel …

The flexible job shop scheduling problem (FJSP), which is NP-hard, widely exists in many
manufacturing industries. It is very hard to be solved. A multi-swarm collaborative genetic …

This article proposes a novel differential evolution algorithm based on dynamic multi-
population (DEDMP) for solving the multi-objective flexible job shop scheduling problem. In …

The distributed flexible job-shop scheduling problem (DFJSP) is an extension of the flexible
job shop scheduling problem, which is a famous NP-complete combinatorial optimization …

Flexible job shop scheduling problems (FJSP) have received much attention from academia
and industry for many years. Due to their exponential complexity, swarm intelligence (SI) …

Flexible job shop scheduling problem (FJSP) is a discrete combinatorial optimisation
problem. By considering its characteristics, a kind of adaptive discrete cat swarm …

Flexible job shop scheduling problem (FJSP) has attracted many research interests, in
particular for meta-heuristic algorithm (MA) developers due to the superior optimization …

Dynamic flexible job shop scheduling has attracted widespread interest from scholars and
industries due to its practical value. Genetic programming hyper-heuristic has achieved …