简介：安排在许多不同服务工业起一个重要作用。在这份报纸，我们提供一些出现在各种各样的服务工业的更重要的安排问题的概述。我们集中于如此的问题的明确的表达以及在使用解决那些问题的技术上。我们考虑在服务工业安排的五个区域，也就是(i)projectscheduling，(ii)安排的员工，(iii)timetabling，保留，和约会，(iv)安排的交通，并且(v)在娱乐安排。开始的二个区域是相当一般的并且在许多不同服务工业有应用。第三，第四和第五个区域是与一些很特定的服务工业有关的更多，也就是好客和护理工业，交通工业(旅客以及货物)，并且娱乐工业。在我们的结论节，我们讨论在各种各样的不同工业使用的问题明确的表达和答案技术的类似和差别，我们也讨论为在服务工业安排被开发了的决定支持系统的设计。

简介：Thispaperstudiestherelationshipbetweentwoprincipaltoolsfortheanalysisofnetworktraffic,namely,effectivebandwidthandnetworkcalculus.Itisshownthatageneralformulationofeffectivebandwidthcanbeexpressedwithintheframeworkofaprobabilisticversionofthenetworkcalculus,wherebotharrivalsandservicearespecifiedintermsofprobabilisticbounds.Aggregateschedulingwithstatisticalserviceassurancesbasedonstatisticalnetworkcalculusispresentedbystrongeffectiveenvelopefunction,insteadofcommonlyusedeffectiveenvelopetoobtainboundsontheamountoftrafficonalink,theproposedschemecanovercometheoverestimationofthenumberofadmittedflows,whichmakesitsuperiortothepreviousschemeespeciallywhenimplementingcalladmissioncontrol.

简介：Intheviewofstaffshortagesandthehugeinventoryofproductsinthecurrentmarket,weputforwardapersonnelschedulingmodelinthetargetofclosingtothedeliverydateconsideringtheparallelism.Thenwedesignedaschedulingalgorithmbasedongeneticalgorithmandproposedaflexibleparalleldecodingmethodwhichtakefulluseofthepersonalcapacity.Casestudyresultsindicatethattheflexiblepersonnelschedulingconsideringtheorder-shopscheduling,machineautomaticcapabilitiesandpersonnelflexibleinthetargetofclosingtothedeliverydateoptimizetheallocationofhumanresources,thenmaximizetheefficiency.

简介：这份报纸基于sum-of-processing-time与更一般的学习效果处理单个机器的安排问题。在这研究，一个工作的处理时间被减少定义的sum-of-processing-time-based学习效果工具处理在顺序先于它的工作的时间的全部的正常工作。甚至与sum-of-processing-time-based的介绍，到工作处理的学习效果预定的结果表演，单个机器的makespan最小化问题仍然保持polynomially可解决。一个全部的结束时间最小化问题的最佳的时间表的曲线关于处理时间的工作正常是塑造V的。

简介：有直角的频率分割的继电器网络的联合多重存取(OFDMA)作为下一代的一个有希望的解决方案被建议了无线系统。就不同的交通的班和服务(QoS)的用户质量而言，三个有效安排算法在如此的网络被介绍。圆知更鸟(RR)在继电器网络的算法用作一个表演基准。数字结果证明建议算法在系统产量和减少系统包损失率上完成重要改进，与中继系统(传统的网络)的RR和缺席相比。而且，比较在三个建议算法之中被执行了。

简介：Motivatedbytheprojectsconstrainedbyspacecapacityandresourcetransportingtime,aprojectschedulingproblemwithcapacityconstraintwasmodeled.Ahybridalgorithmisproposed,whichusestheideasofbi-levelschedulingandprojectdecompositiontechnology,andthegeneticalgorithmandtabusearchiscombined.Topologicalreorderingtechnologyisusedtoimprovetheeffciencyofevaluation.Simulationresultsshowtheproposedalgorithmcanobtainsatisfiedschedulingresultsinacceptabletime.

简介：SinceManufacturingExecutionSystem(MES)isabridgewhichlinkstheupperplanningsystemoftheenterpriseandthecontrolsystemoftheshopfloor,variouskindsoftheinformationwithdifferentcharacteristicsflowthroughthesystem.TheinformationenvironmentofMESanditseffectonMESschedulingareanalyzed.Amethodologicalproposalisgiventoaddresstheproblemofagileschedulinginacomplexinformationenvironment,basedonwhichamicroeconomicmarketandgametheoreticmodel-basedschedulingapproachispresented.Thefuturedevelopmentofthismethodisalsodiscussed.

简介：Deadlockmustbeavoidedinamanufacturingsystem.Inthispaper,anefficientalgorithmforfindinganoptimaldeadlock-freeschedulesinamanufacturingsystemwithverylimitedbufferispresented.Thisalgorithmisbasedonheeffectivegeneticalgorithm(GA)searchmethod,andaformalPetrinetstructureisintroducedtodetectthetokenplayerassuringdeadlock-free.InordertomaketheschedulingstrategygeneratedbyGAmeettherequiredconstraintofdeadlock-free,someresultsofthestruetureanalysisofPetrinetareinvolvedasacriteriontoselectdeadlock-freeschedulefromthepopulationgeneratedbyGA.Theeffectivenessandefficiencyoftheproposedapproachisillustratedbyusinganexample.

简介：

简介：

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

简介：这工作求婚为解决安排问题到还原剂的传统的flowshop的一条混合途径makespan(全部的结束时间)。解决安排问题，决定树(DT)的联合并且散布搜索(SS)算法被使用。开始，DT被用来产生然后被给输入SS在makespan的最佳的解决方案附近获得最佳的/的一个种子解决方案。DT使用了熵功能把给定的问题变换成结构化的格式/规则设置了的一棵树。SS通过多样化提供搜索空间的广泛的调查。DT和SS的优点被用来形成一个混血儿途径。建议算法与为安排的flowshop可得到的各种各样的基准数据集被测试。统计结果证明建议方法为解决flowshop问题能干、有效。

简介：Thispaperconsiderssingle-machineschedulingproblemsingrouptechnologywiththejobs'processingtimesbeingsimplelinearfunctionsoftheirstarttimes.Theobjectivefunctionsaretheminimizingofmakespanandtotalweightedcompletiontime.SomeoptimalconditionsandalgorithmsaregivenandthefactthattheproblemoftotalweightedcompletiontimesisNP-hardisproved.

简介：Aprecedenceorderisdefinedbasedonthereleasedatesofjobs’directsuccessors.UsingthedefinedprecedenceorderandHeapSort,anewpolynomialalgorithmisprovidedwhichaimstosolvetheparallelschedulingproblemP|pj=1,rj,outtree|Cj.Thenewalgorithmisshowntobemorecompactandeasiertoimplement.

简介：这份报纸在相同平行用机器制造最小化最大的流动时间的m上与拒绝考虑安排问题。甚至当有一台单个机器，所有工作有二个不同出版日期时，作者证明这个问题是NP难的。而且，在场的作者一个动态编程算法和二个近似算法到解决他们。

简介：a scheduling algorithm can be characterized as an intelligent agent. The agent can make decisions based on the response from the environment and take action (computation). We name this agent computing agent. The dynamic integration of scheduling algorithms is the integration of different computing agents under the scheduling of a manager.,Of course we can not and need not design agents for each algorithm. But we can do that for each class. Our solution is to joint different classes of computing agents into a MASS to realize dynamic integration of scheduling algorithms. Except for a manager,A scheduling algorithm is a process of solving scheduling problems. The process needs to keep contact with the environment. Assembled with a rule base

简介：ThispaperproposesanobjectorientedmodelschedulingforparallelcomputinginmediaMultiProcessorsSystemonChip(MPSoC).Firstly,theCoarseGrainDataFlowGraph(CGDFG)parallelprogrammingmodelisusedinthisapproach.Secondly,thisapproachhasthefeatureofunifiedabstractionforsoftwareobjectsimplementinginprocessorandhardwareobjectsimplementinginASICs,easyformappingCGDFGprogrammingonMPSoC.Thisapproachcutsdownthekerneloverheadandreducesthecodesizeeffectively.Theprincipleoftheorientedobjectmodel,themethodofscheduling,andhowtomapaparallelprogrammingthroughCGDFGtotheMPSoCareanalyzedinthisapproach.Thisapproachalsocomparesthecodesizeandexecutioncycleswithconventionalcontrolflowscheduling,andpresentsrespectivemanagementoverheadforoneapplicationinme-dia-SoC.

简介：

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

简介：Indownlinkcoordinatedmulti-point(CoMP)system,fullcooperationisalwaysnotapplicableinrealworldbecauseofitshighrequestinthebackhaul.Todealwiththisproblem,clusteringdecisionismadetoprocesstransmission.Inthispaperclusteringmethodsbasedonthemetricsignal-to-leakage-plus-noise(SLNR)isproposed.Inaddition,userschedulingschemesbasedonSLNRisalsoputuptomaketheschedulingsetaslargeaspossible.Simulationresultsshowthattheproposedclusteringmethodsnotonlyreducethedatasharingamongthecooperatingbasestations(BSs),butalsoimprovethesystemthroughputcomparedwiththetraditionalclusteringmethodsbasedonchannelstrength.