Testing the Performance of Bat-Algorithm for Permutation Flow Shop Scheduling Problems with Makespan Minimization

Testing the Performance of Bat-Algorithm for Permutation Flow Shop Scheduling Problems with Makespan Minimization

Abstract In this work, a BAT Algorithm is proposed to solve the permutation flow shop scheduling problem (PFSSP) with minimizing makespan criterion. In a PFSSP, there are n-jobs and m-machines with a proportional deterioration is considered in which all machines process the jobs in the same order, i...

Full description

Bibliographic Details
Main Authors: Jeen Robert Bellabai, Brabin Nivas Murugadhas Leela, Senthil Maharaj Ramesh Kennedy
Format: Article
Language:English
Published: Instituto de Tecnologia do Paraná (Tecpar) 2022-08-01
Series:Brazilian Archives of Biology and Technology
Subjects:
Scheduling
Flow shop
BAT algorithm
Makespan
Benchmark Problem
Online Access:http://www.scielo.br/scielo.php?script=sci_arttext&pid=S1516-89132022000100620&lng=en&tlng=en

Internet

http://www.scielo.br/scielo.php?script=sci_arttext&pid=S1516-89132022000100620&lng=en&tlng=en

Similar Items