基于排隊(duì)和排序理論的兩階段越庫(kù)作業(yè)調(diào)度算法研究.pdf

1、北京交通大學(xué)碩士學(xué)位論文基于排隊(duì)和排序理論的兩階段越庫(kù)作業(yè)調(diào)度算法研究姓名：王剛申請(qǐng)學(xué)位級(jí)別：碩士專業(yè)：系統(tǒng)工程指導(dǎo)教師：彭宏勤20080501北京交通大學(xué)碩士學(xué)位論文ABS瞰CTABSTRACT：訛eCrossDockingisaverypracticalmethodofoperationsoflogisticswarehousing。TheschedulingofCrossDockingisatypicalofJobShopSort

2、ing；itismorecomplex，theresearchonqueuingandsortingaleveryimportantfoundationsofCrossDockingscheduling。ThearticleputforwardthisviewbytheorywithpracticefirsttimeThisarticlestudiedtheCrossDockingontheviewoftheoryfirstinclud

3、ingtheclassificationofCrossDockingconditionsoftheimplementations，processesandadvantagesThenstudiedonsortingandputforwardaviewofthebestschedulingmethodofCrossDockingwhichisJobShopSortingfirstlyThisquestionCanbetransferint

4、oschedulingproblem蛾mtheorderofoperationsandsortofparallelmachineproblems。TheCrossDockingschedulingcontainstherelationshipbetweenthequantityofgoodsandthequantityofthedoorsofCrossDockingdistributioncenterTheindoorsCaninflu

5、encethecostsofthefacilitiesandlaborsThemoreindoorstherehas，themorecostsitwillbe；ontheoppositethecostswillbelowerBythisviewpointthisarticleputforwardamethodofQueuingtheorytosolvetheoptimalindoors，inordertoshortingQueuingt

6、imeandQueuinglengthbylesscostsT|lisarticleuseQueuingtheorytostudytheCrossDockingschedulingandimprovetheJohnsonmethodtosolvethetwostageschedulingproblemsAndsolvingtheproblembyprogrammingverifiedthecapabilityofthesortingan