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

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

简介：

简介：WesolvetheproblemofuplinkvideostreaminginCDMAcellularnetworksbyjointlydesigningtheratecontrolandschedulingalgorithms.Inthepricing-baseddistributedratecontrolalgorithm,thebasestationannouncesapricefortheperunitaveragerateitcansupport,andthemobiledeviceschoosetheirdesiredaveragetransmissionratesbybalancingtheirvideoqualityandcostoftransmission.Eachmobiledevicethendeterminesthespecificvideoframestotransmitbyavideosummarizationprocess.Inthetime-division-multiplexing(TDM)schedulingalgorithm,thebasestationcollectstheinformationonframestobetransmittedfromalldeviceswithinthecurrenttimewindow,sortstheminincreasingorderofdeadlines,andschedulesthetransmissionsinaTDMfashion.Thisjointalgorithmtakesadvantageofthemulti-usercontentdiversity,andmaximizesthenetworktotalutility(i.e.,minimizethenetworktotaldistortion),whilesatisfyingthedeliverydeadlineconstraints.Simulationsshowedthattheproposedalgorithmsignificantlyoutperformstheconstantrateprovisionalgorithm.

简介：Thispaperstudiesonlineschedulingofjobswithkindreleasetimesonasinglemachine.Here“kindreleasetime”meansthatinonlinesetting,nojobscanbereleasedwhenthemachineisbusy.EachjobJhasakindreleasetimer(J)≥0,aprocessingtimep(J)>0andadeadlined(J)>0.Thegoalistodetermineaschedulewhichmaximizestotalprocessingtime(∑p(J)E(J))ortotalnumber(∑E(J))oftheacceptedjobs.Forthefirstobjectivefunction∑p(J)E(J),wefirstpresentalowerbound√2,andthenprovideanonlinealgorithmLEJwithacompetitiveratioof3.Thisisthefirstdeterministicalgorithmfortheproblemwithaconstantcompetitiveratio.Whenp(J)∈{1,k},k>1isarealnumber,wefirstpresentalowerboundminf(1+k)/k,2k/(1+k)g,andthenweshowthatLEJhasacompetitiveratioof1+┌k┐=k.Inparticular,whenalltheklengthjobshavetightdeadlines,wefirstpresentalowerboundmax{4=(2+k),1}(for∑p(J)E(J))and4/3(for∑E(J)).ThenweprovethatLEJis┌k┐/k-competitivefor∑p(J)E(J)andweprovideanonlinealgorithmHwithacompetitiveratioof2┌k┐/(┌k┐+1)forthesecondobjectivefunction∑E(J).

简介：在这篇论文，我们以速度在二台一致机器上调查安排问题的变体1；s。为这个问题，我们被给二台潜在的一致机器处理独立工作的一个序列。机器需要在开始到过程前被激活，；激活的每台机器招致固定机器激活费用。没有机器开始被激活，；当一个工作被揭示时，算法有选择激活新机器。目的是最小化makes平底锅的和；机器激活费用。我们与竞争比率设计最佳的联机算法(2s+1)为每s≥1的/(s+1)。

简介：

简介：为无线特定的网络的大量应用程序是时间批评的并且在通讯潜伏上强加紧要求。关键通讯操作之一是从一个来源节点广播一条消息。这篇论文学习在没有碰撞的传播模型下面在无线特定的网络安排问题的最小的潜伏广播。为这个NP难的问题的以前最好的已知的算法生产其潜伏是至少648的一张广播时间表(r最大/rmin)2时间最佳的时间表，在哪儿r最大和rmin分别地是在一个网络的节点的最大、最小的传播范围。我们显著地由至多建议表演比率是其近似的一个新安排算法改进这结果(1+2r最大/rmin)2+32。而且，在建议安排下面，每个节点就需要至多提交一条消息一次。

简介：

简介：Weproposethespectrumallocationandresourceschedulingalgorithmsincognitivepointtomultipoint(PMP)networkswithrapidchangesofspectrumopportunitiesandpresentamediaaccesscontrol(MAC)protocolbasedonthesealgorithms.Theobjectiveofspectrumallocationistomakeefficientuseofthespectrumwhilemaintainingthetransceiversynchronizationonfrequencyandtimeinthenetwork.Theobjectiveofresourceschedulingistoguaranteethequalityofservice(QoS)requirementsofdifferentkindsofconnectionsandtominimizethetotalenergyconsumptioninthenetworkaswell.Bysensingonlyasmallsetofpossiblechannelsineachslotbasedonthestatetransitionprobabilityofeachchannel,ourspectrumallocationalgorithmachieveshighspectrumefficiencyinthenetwork.Theresourceschedulingproblemisdividedintothreesubproblemsandwederiveoptimalsolutionstotheseproblemsbygreedyalgorithmandconvexoptimization.Thesimulationresultsshowthatouralgorithmcanmakeefficientuseofthespectrumandthenetworkresourcesatacostoflowcomputationalcomplexity.

简介：Inthispaper,anewsimulationapproachforsolvingthemixedtrainschedulingproblemonthehigh-speeddoubletrackraillineispresented.Basedonthediscrete-timemovementmodel,weproposecontrolstrategiesformixedtrainmovementwithdifferentspeedsonahigh-speeddouble-trackrailline,includingbrakingstrategy,priorityrule,travellingstrategy,anddepartingrule.Anewdetailedalgorithmisalsopresentedbasedontheproposedcontrolstrategiesformixedtrainmovement.Moreover,weanalyzethedynamicpropertiesofrailtrafficflowonahigh-speedrailline.Usingourproposedmethod,wecaneffectivelysimulatethemixedtrainscheduleonarailline.Thenumericalresultsdemonstratethatanappropriatedecreaseofthedepartureintervalcanenhancethecapacity,andasuitableincreaseofthedistancebetweentwoadjacentstationscanenhancetheaveragespeed.Meanwhile,thecapacityandtheaveragespeedwillbeincreasedbyappropriatelyenhancingtheratiooffastertrainnumbertoslowertrainnumberfrom1.

简介：Inthispaper,weconsiderParallelMachinesSchedulingwithnonsimultaneousmachineavailabletime.WegivetheexactworstcaseperformanceboundofMLPTproposedbyLee.Furthermore,twoothermodifiedLPTalgorithmsarediscussed.Thepaperisendedbynumericalex-perimentsofthesealgorithms.

简介：Thispaperconsidersaschedulingproblemintwo-stagehybridflowshop,wherethefirststageconsistsoftwomachinesformedanopenshopandtheotherstagehasonlyonemachine.Theobjectiveistominimizethemakespan,i.e.,themaximumcompletiontimeofalljobs.WefirstshowtheproblemisNP-hardinthestrongsense,thenwepresenttwoheuristicstosolvetheproblem.Computationalexperimentsshowthatthecombinedalgorithmofthetwoheuristicsperformswellonrandomlygeneratedprobleminstances.

简介：