简介：ResultsonsupervisorycontrolofdiscreteeventprocessesaremainlyconcernedwithdesigningacontrollersuchthattheclosedloopsystemgeneratesalanguageLwhichcoincideswiththetargetlanguage.Inthispaperweconsidersupervisorycontrolproblemforaclassofdiscreteeventprocesseswhenthedesigntargetisthatacertainsetoflanguagepatternscannotoccurintheclosedlooplanguage.AheuristicsupervisorisconstructedviatheheuristicsearchmethoddevelopedinAI.Thisschemerequiresonlytheinformationaboutthecontrollabilityoftheeventsymbolset.Itiscapableofdesigningamodularheuristicsupervisorwhentherearemanysuchforbiddenstrings.Effectivenessofsuchasupervisorisprovedforsystemswithperfectandpartialobservation.

简介：

简介：异构的计算(HC)环境与不同计算能力利用多样的资源解决有多样的计算要求和限制的计算集中的应用程序。在HC环境的任务指派问题能正式至于任务和机器的一个给定的集合被定义，把最小使平底锅成为的任务分到完成的机器。在这篇论文，我们建议首先安排启发式的、高标准偏差的一项新任务(HSTDF)，它把一项任务的期望的实行时间的标准偏差看作一个选择标准。一项任务的期望的实行时间的标准偏差在不同机器上在任务实行时间代表变异量。我们的结论是有高标准偏差的任务必须为安排被分配第一。实验的一个大数被执行检查有效性求婚在有存在启发规则的不同情形，和比较启发式(Max-min，Sufferage，分割了Min平均的、分割的Min-min，并且分割了Max-min)清楚地表明求婚启发式以一般水准超过所有存在启发规则做平底锅。

简介：

简介：Thispaperintroducesbackgroundofroughsettheory,thenproposesanewalgorithmforfindingoptimalreductionandmakecomparisonbetweentheoriginalalgorithmandtheimprovedonebytheexperimentabouttheninestandarddatasetinULdatabasetoexplainthevalidityoftheimprovedheuristicalgorithm.

简介：ＡＦｕｚｚｙＲｅａｓｏｎｉｎｇＳｙｓｔｅｍａｎｄＩｔｓＨｅｕｒｉｓｔｉｃＩｎｆｅｒｅｎｃｅＡｌｇｏｒｉｔｈｍＺｕｏＸｉａｏｄｅ＆ＬｉａｎｇＹｕｎＤｅｐｔ．ｏｆＢｕｓｉｎｅｓＡｄｍｉｎｉｓｔｒａｔｉｏｎ，ＪｉｎａｎＵｎｉｖｅｒｓｉｔｙ，Ｇｕａｎｇｚｈｏ...

简介：

简介：Ajobshopschedulingproblemwithacombinationprocessingincomplexproductionenvironmentisproposed.Basedonthedefiningof'non-elasticcombinationprocessingrelativity'and'virtualprocess',theproblemcanbesimplifiedandtransformedtoatraditionalone.Onthebasisofthedispatchingrulesselectengineandconsideredfactorsofcomplexproductionenvironment,aheuristicmethodisdesigned.ThealgorithmhasbeenappliedtoamouldenterpriseinShenzhenforhalfayear.Thepracticeshowedthatbyusingthemethodsuggestedthenumberofdelayedorderswasdecreasedabout20%andtheproductivitywasincreasedby10to20%.

简介：

简介：以便折衷探索/利用并且由房间geneticalgorithm启发了一个房间移动转线路操作员因为进化算法(EA)在这个paper.The定义领域被建议被划分成重新尺寸立方的子域(房间)和在一个n维的立方体的每individuallocates。如果他们在不同房间(探索)并且随后，thecrossover的房间数字配对的房间移动转线路第一交换从它的起始的地方转移firstindividual到另外的个人“s房间地方。如果他们已经在thesame房间，启发式的转线路(利用)被使用。有基因差异的vary的Cell-shift/heuristic转线路adaptivelyexecutes探索/利用搜索。当与最近的著名FEP进化算法作比较时，房间移动EAhasexcellent表演通常以十上的效率和功效使用了optimizationbenchmarks。

简介：ThispaperproposesandevaluatestwoimprovedPetrinet(PN)-basedhybridsearchstrategiesandtheirapplicationstoflexiblemanufacturingsystem(FMS)scheduling.Thealgorithmsproposedinsomepreviouspapers,whichcombinePNsimulationcapabilitieswithA*heuristicsearchwithinthePNreachabilitygraph,maynotfindanoptimumsolutionevenwithanadmissibleheuristicfunction.Toremedythedefectsanimprovedheuristicsearchstrategyisproposed,whichadoptsadifferentmethodforselectingthepromisingmarkingsandreservestheadmissibilityofthealgorithm.Tospeedupthesearchprocess,anotheralgorithmisalsoproposedwhichinvokesfasterterminationconditionsandstillguaranteesthatthesolutionfoundisoptimum.TheschedulingresultsarecomparedthroughasimpleFMSbetweenouralgorithmsandthepreviousmethods.Theyarealsoappliedandevaluatedinasetofrandomly-generatedFMSswithsuchcharacteristicsasmultipleresourcesandalternativeroutes.

简介：Thispaperproposesaheuristicstateminimizationalgorithm(HSM2)forfinitestatemachines(FSM).HSM2focusesonthegenerationandadjustmentoftheclosedcover.Firstaninitialclosedcoverisgeneratedbyheuristicallyselectingpropermaximalcompatiblestosatisfyallthecoveringandclosureconditions,andthenitisadjustedtobeaminimalornearminimalclosedcoverbyheuristicallyremovingrepeatedstates.Experimentalresultsshowthatthealgorithmisfasterandobtainsbetterorthesamesolutionscomparedwithconventionalmethods.

简介：Themachine-toolsperformanceswithintheframeworkofhigh-speedmachiningbothdependonthedesignofthereferencetrajectoryandonthetuningoftheservocontrollers.Thereductionofthecontouringerrorcanbeachievedbyadaptingthefeedratetothepathprofile.Analternativemethodconsistsofsmoothingthespatialtrajectorythatallowstodecreasethecycletime.Apathsmoothingtechniqueisprovided,whichusesananalogywithracing-carpiloting.Thetrajectoryismodifiedpointwiseaccordingtoasetofrulesandisdesignedusingfuzzycontrol.

简介：我们在场为嵌套问题的一个新算法。许多同等地，spaced点被放在一张表上，并且一片被移动到点之一并且由一个角度旋转了。点和旋转角度组成片的收拾行李的态度。我们建议一个新算法说出HAPE(启发式的算法基于最小的全部的势能的原则)发现片在有最低重心的最佳的收拾行李态度。另外，为多角形重叠测试的一种新技术被建议它避免no-fit-polygon(NFP)的费时间的计算。HAPE的详细实现被介绍，二个计算实验被描述。第一个实验基于一个真实工业问题并且第二在11个出版基准问题上。用一爬山(HC)寻找方法，建议算法与另外的出版答案比较表现很好。

简介：Amodifiedbottleneck-based(MB)heuristicforlarge-scalejob-shopschedulingproblemswithawell-definedbottleneckissuggested,whichissimplerbutmoretailoredthantheshiftingbottleneck(SB)procedure.Inthisalgorithm,thebottleneckisfirstscheduledoptimallywhilethenon-bottleneckmachinesaresubordinatedaroundthesolutionsofthebottleneckschedulebysomeeffectivedispatchingrules.ComputationalresultsindicatethattheMBheuristiccanachieveabettertradeoffbetweensolutionqualityandcomputationaltimecomparedtoSBprocedureformedium-sizeproblems.Furthermore,itcanobtainagoodsolutioninashorttimeforlarge-scalejob-shopschedulingproblems.