The complex problems in the real world, an increase in competition among producers, the
advancements in equipment and manufacturing products, the high cost of factory equipment …

Recent advancements in production scheduling have arisen in response to the need for
adaptation in dynamic environments. This paper addresses the challenge of real-time …

The distributed permutation flow shop scheduling (DPFSS) is a permutation flow shop
scheduling problem including the multi-factory environment. The processing times of the …

This paper deals with the Fuzzy Hybrid Flow Shop (FHFS) scheduling inspired by a real
apparel process. A Parallel Greedy (PG) algorithm is proposed to solve the FHFS problems …

In the current global cooperative production mode, the distributed fuzzy flow-shop
scheduling problem (DFFSP) has attracted much attention because it takes the uncertain …

With the influence of the digital economy, the traditional manufacturing model is undergoing
a shift towards a distributed manufacturing model. This transition involves multiple …

In the conventional scheduling problem, the parameters such as the processing time for
each job and due dates are usually assumed to be known exactly, but in many real-world …

In the no-wait flow shop scheduling problem, n-job should be proceeded on m-machine with
the same order and do not permit the jobs to wait during the scheduling periods. Also, at the …

Inspired by various behaviors of creatures in nature, numerous efficient bionic algorithms
are designed for dealing with complex clustering problems. As a population-based …

The no-wait scheduling problem is a subclass of the flow shop. In a no-wait flow shop
scheduling (NWFSS), jobs are not allowed to wait between consecutive machines. There is …