A contributionandnewheuristicsforopenshopscheduling

This paperdealswithopenshopsundermakespanminimization.Encodingschemeplaysapivotalrole in thesuccessofanyalgorithmtosolveaschedulingproblem.Althoughthepermutationlisthasmany advantages (suchashighadaptabilitytoanyoperators,conceptualsimplicityandeaseofimplementa- tion), itsuffersfromanotoriousinherentdrawback,calledredundancy.Thisseriousdrawbackhasmade many researchersconcludethatpermutationlistisineffectiveforopenshopscheduling.Therefore,they have turnedtowardtheutilizationofrankmatrixencodingschemetoovercomethisshortcomingat the expenseoflosingotheradvantagesofpermutationlist.Inthispaper,wefirstpinpointtheoriginof redundancy inthepermutationlist.Wethenanalyzecircumstancesinwhichtheredundancyoccursand afterwards presentfourefficienttheoremstoavoidthiscriticaldisadvantage.Regardingthetheorems, we understandthatredundancyisquiteidentifiableandalsocontrollable.Byintroducinganalternative possibility torankmatricesofexcludingredundancy,thesolutionspaceofopenshopsissignificantly reduced. Byreducingthesearchspace,theprobabilityoffindinganexcellentsolutioninreasonable computational timeoutstandinglysoars.Finally,basedoninsertionandreinsertionoperatorswepropose four constructiveheuristicsincorporatingsimpleapplicationsofthetheorems.Weevaluatetheeffective- ness andefficiencyofourproposedalgorithmsonthreewell-knownbenchmarksandagainstsomeother existing heuristics.Alltheresultsandanalysesillustratetheauthenticityandsuperiorityofourtheorems and proposedconstructiveheuristics.