The flexible job shop scheduling problem (FJSP) is an NP-hard combinatorial optimization
problem, which has wide applications in the real world. The complexity and relevance of the …

Flexible job shop scheduling problem (FJSP) is an NP‐hard combinatorial optimisation
problem, which has significant applications in the real world. Due to its complexity and …

This study investigates the optimization of non-permutation flow-shop scheduling problems
and lot-sizing simultaneously. Contrary to previous works, we first study the energy …

Inthis study, a flexible job shop scheduling problem with time-of-use electricity price
constraint is considered. The problem includes machine processing speed, setup time, idle …

The first part of this chapter describes the foundation of genetic algorithms. It includes hybrid
genetic algorithms, adaptive genetic algorithms, and fuzzy logic controllers. After a short …

Path planning and integrated scheduling are two important problems to be resolved in the
design of any automated container terminal. There has been relatively little research …

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 …

This paper proposes an improved hybrid genetic algorithm with variable neighborhood
search (HGA-VNS) for addressing the flexible job shop scheduling problem (FJSP) …

In practical applications, particularly in flexible manufacturing systems, there is a high level
of uncertainty. A type-2 fuzzy logic system (T2FS) has several parameters and an enhanced …

In the actual manufacturing process, the environment of the job shop is complex. There will
be many kinds of uncertainties such as random job arrivals, machine breakdowns, order …