An Jayvasu Algorithm For Solving Permutation Flow Shop Scheduling Problem

EasyChair Preprint 4450

Abstract

In this paper, we have focused our attention on minimizing the total elapsed time for solving flow shop scheduling. We have given a simple heuristic approach namely Jayvasu algorithm to solve the permutation flow shop scheduling problem. The analysis and result indicate that our algorithm performs better than the algorithms available in the literature namely Palmer's, CDS, Gupta, RA, and NEH. In fact, our algorithm is simple and easy to use when compared with others.

Keyphrases: Scheduling., Total elapsed time, flow shop, heuristic

@booklet{EasyChair:4450,
  author    = {G. Vasudevan and S. Jayakumar Sundramurthy},
  title     = {An Jayvasu Algorithm For Solving Permutation Flow Shop Scheduling Problem},
  howpublished = {EasyChair Preprint 4450},
  year      = {EasyChair, 2020}}