Flow shop scheduling is a type of where sequence follows for each job on set machines processing. In practice, jobs in flow shops can arrive at irregular times, and the no-wait constraint allows changes order to flexibly manage such irregularity. The flexible problems with have mainly addressed optimization floor manufacturing, processing, allied industries. scope this paper identify literature...

Permutation flow shop scheduling problem (PFSP) is a well-known NP-hard with extensive engineering relevance. Consequently, various meta-heuristics have been proposed to obtain near optimum solutions. However, most of them involve tuning algorithm-specific parameters, which leads excessive computational complexities. A recently developed meta-heuristic named Jaya algorithm simple yet efficient ...