Nature-inspired metaheuristic algorithms have attracted much attention in the last decade,
and new algorithms have emerged almost every year with a vast, ever-expanding literature …

Empty or limited storage capacities between machines introduce various types of blocking
constraint in the industries with flowshop environment. While large applications demand …

The job shop scheduling problem (JSP) has consistently garnered significant attention. This
paper introduces an improved genetic algorithm (IGA) with dynamic neighborhood search to …

In the context of Industry 4.0, flexible manufacturing systems play an important role. They are
designed to provide the possibility to adapt the production process by reacting to changes …

The literature published since the year 2000 was reviewed regarding the no-wait flow-shop
scheduling (No-WFSS) problem. The No-WFSS problem with separate set-up times and …

This work addresses a particular case of the group shop scheduling problem (GSSP) which
will be denoted as the fixed group shop scheduling problem (FGSSP). In a FGSSP, job …

The job shop scheduling problem is a difficult combinatorial optimization problem. This
paper presents a hybrid algorithm which combines global equilibrium search, path relinking …

Surface roughness is a significant factor in determining the product quality and highly
impacts the production price. The ability to predict the surface roughness before production …

The distributed assembly permutation flowshop problem (DAPFSP) is a typical NP-hard
combinatorial optimization problem and represents an important area in multiple distributed …

The job shop scheduling problem with makespan criterion is valuable from both practical
and theoretical points of view. This problem has been attacked by most of the well-known …