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) has attracted research interests as it can
significantly improve the energy, cost, and time efficiency of production. As one type of …

Production scheduling is challenging and the body of literature addressing various variants
of the problem is large. It can roughly be divided into two streams: The first stream addresses …

The quest for sustainability has arrived to the manufacturing world, with the emergence of a
research field known as green scheduling. Traditional performance objectives now co-exist …

This paper investigates a dynamic scheduling problem within a job shop robotic cell,
wherein multiple robotic arms are responsible for material handling in a U-shaped …

Constraint programming solvers are known to perform remarkably well for most scheduling
problems. However, when comparing the performance of different available solvers, there is …

The flexible job shop scheduling problem (FJSP) is of great importance for realistic
manufacturing, and the problem has been proven to be NP-hard (non-deterministic …

This paper considers a distributed permutation flowshop scheduling problem with sequence-
dependent setup times (DPFSP-SDST) to minimize the maximum completion time among …

In recent years, researchers have been paying special attention to scheduling problems with
setup times and costs, aiming to adopt more realistic assumptions. This paper aims at …

Nowadays, the manufacturing sector needs higher levels of flexibility to confront the
extremely volatile market. Accordingly, exploiting both machine and workforce …