Paper Title
Minimizing Makespan in a Blocking Flow Shop using Jaya Algorithm

Abstract
Jaya algorithm is proposed in this paper to solve the Blocking Permutation Flow Shop Scheduling Problem (BPFSP) under the objective of minimizing the makespan. To adapt this algorithm for the BPFSP, the largest position value heuristic rule (SPV) is used to transform the continuous population vectors into sequences of jobs. Also, the diversity of the Jaya algorithm is improved by applying the well known NEH heuristic to generate a good quality initial solution. In addition, an iterated local search (ILS) is applied to perform the exploration of the Jaya algorithm. The computational study demonstrates that the improved Jaya algorithm is outperforming very recent algorithms that introduced for the BPFSP with makespan criterion. Keywords - Jaya Algorithm, Blocking Permutation Flow Shop Scheduling Problem, NEH Heuristic, Iterated Local Search.