A simulatedannealingalgorithmbasedonblockpropertiesforthejobshop schedulingproblemwithtotalweightedtardinessobjective

In modernmanufacturingsystems,duedaterelatedperformanceisbecomingincreasinglyimportantin maintainingahighservicereputation.However,comparedwiththeextensiveresearchonmakespan minimization,researchonthetotalweightedtardinessobjectiveiscomparativelyscarce,partlybecause this objectivefunctionismoredifficultandcomplextooptimize.Inthispaper,wefocusonthejobshop schedulingproblemwiththeobjectiveofminimizingtotalweightedtardiness.First,wediscussthe mathematicalprogrammingmodelanditsdualitywhentheprocessingordersforeachmachineare fixed. Then,ablock-basedneighborhoodstructureisdefinedanditsimportantpropertiesareshown. Finally,asimulatedannealingalgorithmisdesignedwhichdirectlyutilizesthefeaturesofthis neighborhood.Accordingtothecomputationalresults,thenewneighborhoodconsiderablypromotes the searchingcapabilityofsimulatedannealingandhelpsitconvergetohigh-qualitysolutions.