6-A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem

《6-A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem》由会员上传分享，免费在线阅读，更多相关内容在学术论文-天天文库。

1、Computers&OperationsResearch35(2008)2807–2839www.elsevier.com/locate/corAdiscreteparticleswarmoptimizationalgorithmfortheno-waitflowshopschedulingproblemQuan-KePana,b,M.FatihTasgetirenc,∗,Yun-ChiaLiangdaCollegeofComputerScience,LiaochengUniversity,Liao

2、cheng,252059,PRChinabSchoolofInformationScienceandTechnology,UniversityofScienceandTechnologyofChina,Hefei230026,PRChinacDepartmentofOperationsManagementandBusinessStatistics,SultanQaboosUniversity,P.O.Box20,AlKhod123,Muscat,SultanateofOmandDepartment

3、ofIndustrialEngineeringandManagement,YuanZeUniversity,No135,Yuan-TungRoad,Chung-Li,TaoyuanCounty,Taiwan320,ROCAvailableonline2April2007AbstractInthispaper,adiscreteparticleswarmoptimization(DPSO)algorithmispresentedtosolvetheno-waitflowshopschedulingpr

4、oblemwithbothmakespanandtotalflowtimecriteria.Themaincontributionofthisstudyisduetothefactthatparticlesarerepresentedasdiscretejobpermutationsandanewpositionupdatemethodisdevelopedbasedonthediscretedomain.Inaddition,theDPSOalgorithmishybridizedwiththev

5、ariableneighborhooddescent(VND)algorithmtofurtherimprovethesolutionquality.Severalspeed-upmethodsareproposedforboththeswapandinsertneighborhoodstructures.TheDPSOalgorithmisappliedtoboth110benchmarkinstancesofTaillard[Benchmarksforbasicschedulingproble

6、ms.EuropeanJournalofOperationalResearch1993;64:278–85]bytreatingthemastheno-waitflowshopprobleminstanceswiththetotalflowtimecriterion,andto31benchmarkinstancesprovidedbyCarlier[Ordonnancementsacontraintesdisjonctives.RAIRORechercheoperationelle1978;12:3

7、33–51],Heller[SomenumericalexperimentsforanM×Jflowshopanditsdecision-theoreticalaspects.OperationsResearch1960;8:178–84],andRevees[Ageneticalgorithmforflowshopsequencing.ComputersandOperationsResearch1995;22:5–13]forthemakespancriterion.Forthemakespancr

8、iterion,thesolutionqualityisevaluatedaccordingtothereferencemakespansgeneratedbyRajendran[Ano-waitflowshopschedulingheuristictominimizemakespan.JournaloftheOperationalResearchSociety1994;45:472–8]whereasforthetotalflowtimecriterion,itisevaluated