Counting the frequency of subgraphs in large networks is a classic research question that reveals underlying substructures these for important applications. However, subgraph counting challenging problem, even sizes as small five, due to combinatorial explosion number possible occurrences. This article focuses on five-cycle, which an special case five-vertex and one most difficult count efficie...

Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...

in this paper, a genetic algorithm is presented for an identical parallel-machine scheduling problem with family setup time that minimizes the total weighted flow time ( ). no set-up is necessary between jobs belonging to the same family. a set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i  j, the duration of this set-up being the sequ...