The permutation flowshop problem is a classic machine scheduling problem where n jobs
must be processed on a set of m machines disposed in series and where each job must visit …

Engineering project managers often face a challenge to allocate tight resources for
managing interdependent risks. In this paper, a quantitative framework of analysis for …

The permutation flow shop scheduling problem (PFSP) which is known to be NP-hard has
been widely investigated in recent years. In this paper, an effective hybrid discrete …

This paper investigates novel GA-based hybrid artificial immune system (AIS) for the
permutation flowshop scheduling problems (PFSP) that minimizes the makespan. The …

The goal of block mining is to obtain a set of genes that contain dependency among gene
relationships. Such blocks without overlapping of genes can be further merged to form a …

A genetic algorithm is a type of heuristic algorithm used to solve permutation flowshop
scheduling problems (PFSPs). Producing an optimal offspring with a variety of genes is …

The traveling salesman problem (TSP) is one of the most studied combinatorial optimization
problems. In this paper, we present the new idea of combining the imperial competitive …

This paper studies the problem of minimising makespan in a no-wait flowshop with two
batch processing machines (comprised of a parallel batch processing machine and a serial …

This work proposes a hybrid of GA and immune algorithm for permutation flowshop
scheduling problems to overcome the problem of GAs early convergence during the …

Estimation of Distribution Algorithms (EDAs) have recently been recognized as a prominent
alternative to traditional evolutionary algorithms due to their increasing popularity. The core …