A hybridTP+PLSalgorithmforbi-objectiveflow-shopschedulingproblems

his paperpresentsanew,carefullydesignedalgorithmforfivebi-objectivepermutationflowshop schedulingproblemsthatarisefromthepairwisecombinationsoftheobjectives(i)makespan,(ii)the sum ofthecompletiontimesofthejobs,and(iii)both,theweightedandnon-weightedtotaltardinessof all jobs.Theproposedalgorithmcombinestwosearchmethods,two-phaselocalsearchandParetolocal search, whicharerepresentativeoftwodifferent,butcomplementary,paradigmsformulti-objective optimizationintermsofPareto-optimality.Thedesignofthehybridalgorithmisbasedonacareful experimentalanalysisofcrucialalgorithmiccomponentsofthesetwosearchmethods.Wecomparedour algorithmtothetwobestalgorithmsidentified,amongasetof23candidatealgorithms,inarecentreview of thebi-objectivepermutationflow-shopschedulingproblem.Wehavereimplementedcarefullythese two algorithmsinordertoassessthequalityofouralgorithm.Theexperimentalcomparisoninthispaper showsthattheproposedalgorithmobtainsresultsthatoftendominatetheoutputofthetwobest algorithmsfromtheliterature.Therefore,ouranalysisshowswithoutambiguitythattheproposed algorithmisanewstate-of-the-artalgorithmforthebi-objectivepermutationflow-shopproblems studiedinthispaper.