This substantially reduces the computation effort and numerical complexity. Computational results reveal that Jaya algorithm is efficient in most cases and has considerable potential for permutation flow-shop scheduling problems. | A discrete Jaya algorithm for permutation flow-shop scheduling problem