作業(yè)車間雙向調(diào)度的遺傳算法及蟻群算法研究.pdf

1、中國(guó)科學(xué)技術(shù)大學(xué)碩士學(xué)位論文作業(yè)車間雙向調(diào)度的遺傳算法及蟻群算法研究姓名：李燕申請(qǐng)學(xué)位級(jí)別：碩士專業(yè)：管理科學(xué)與工程指導(dǎo)教師：陳華平20090401AbstractAbStraCtJobshopschedul灑gproblemisaHndofmost帥icalcombinatorialoptimizationproblemsaboutresourcedistribution血whichproducetaskisgiVenhtsofpra

2、cticalproblemscan白眥塔fo肋謝thitBidirectionschedulingproblembelongst0claLssicalschedlllingpmblem，howeVeritsschedulingaimisnotomymakespan，butalso讎(ingdeadlineoft11ecriticaljobsintoaccomt，matis，吼derpreconditionofens砸ng撕ticaljo

3、bstosatis匆deadline，teducemakespanaSmuchaSpossible，sothat洫practicalproductionwecalldecreaSelossesandincreaseprofitSe伍cienUyTtlissortofproblemismofecomplexthaJlcommonclaSsicalschedulingproblems，butitisclosert0realenviroIlr

4、nent，th耵efore，thereissi嘶ficantacademicandeconomicvalueinmereseaIchonitFirstofall，t11isp印ergenerallyintroducessomebasicconceptionS，defiI血ions，claSsifications，andalgorimmst0getnlesolutionarnsmTullarizestheresearchstatuSquo

5、andresultsabouttIlereleVanIaLspectSSecondly，tllispapercombinesgeneticalgorinull、)~rimbidirectionschedulingproblem，proVidillgafeaSibles01utiontobidirectionschedulingproblemThenthispaperproVesitSfeasibilit)，byemula_tionale

6、xperiment，nlirdly，thispapercombinesan觚tcolonyalgo棚1111withbi—directionschedulingalgorithmtosolVemejobshopschedulingproblemwimtheoptimizationaimofthemal(espalla11ddeadlineofcriticaljobsBasedonthe刪itionalaJltc010ny出gorithm

7、，、Ⅳe刪uSttlleeVaporationcoe觚ientpadaptiVely，adoptnewheuristicnllestodefinet11eVisibilit)r劬ction％(f)a11dupdate伽leallowedi11adi虢rent、MayBesides，也eadaptiVeantalgorith】nispr0Vedtobebe訛rmall妒neticalgorittl】[nwllichiswidelyused

8、no、^，adaysinbi—directionschedulillgLaStbutnottheleast，IsumupmewhoIepaper孤1dpresentsomeproposalsaIldprospectst06mlre：researchKeywords：Jobshop，bi—direction，scheduling，makespaJl，deadline，GeneticAlgorithm，AntColonyAlgorithmⅡ