Download PDFOpen PDF in browserAn Jayvasu Algorithm For Solving Permutation Flow Shop Scheduling ProblemEasyChair Preprint 44507 pages•Date: October 21, 2020AbstractIn 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
|