The distributed assembly mixed no-idle permutation flowshop scheduling problem
(DAMNIPFSP), a common occurrence in modern industries like integrated circuit production …

This paper considers an energy-efficient bi-objective unrelated parallel machine scheduling
problem to minimize both makespan and total energy consumption. The parallel machines …

We solve a distributed permutation flowshop scheduling problem (DPFSP) with non-
identical factories, which is also referred to as the distributed heterogeneous permutation …

In the last years, researchers are paying special attention to scheduling in distributed
environments due to the increasing benefits of multi-factory manufacture. In this paper, we …

This article deals with a practical distributed hybrid differentiation flowshop scheduling
problem (DHDFSP) for the first time, where manufacturing products to minimize makespan …

In this paper, a discrete Water Wave Optimization algorithm (DWWO) is proposed to solve
the no-wait flowshop scheduling problem (NWFSP) with respect to the makespan criterion …

This chapter reviews applications of Memetic Algorithms in the areas of business analytics
and data science. This approach originates from the need to address optimization problems …

Flow shop scheduling is a type of scheduling where sequence follows for each job on a set
of machines for processing. In practice, jobs in flow shops can arrive at irregular times, and …

The Mixed No-Idle Flow-shop Scheduling Problem (MNIFSP) is an extension of flow-shop
scheduling, which has practical significance and application prospects in production …

This article addresses the blocking distributed flow shop scheduling problem with lot-
streaming (BDFSPL) with the objective of minimizing the maximum completion time, or …