物流管理畢業(yè)論文參考文獻(xiàn)模板
參考文獻(xiàn)是對(duì)期刊論文引文進(jìn)行統(tǒng)計(jì)和分析的重要信息源之一，下面是小編搜集整理的物流管理畢業(yè)論文參考文獻(xiàn)模板，供大家閱讀查看。
參考文獻(xiàn)一：
[1]周云.機(jī)械制造業(yè)物流發(fā)展綜述[J].東北林業(yè)大學(xué)學(xué)報(bào)，2007(9)：52-55.
[2]葉宏漠.企業(yè)資源規(guī)劃ERP：整合資源管理篇[M].北京：電子工業(yè)出版社，2002.
[3]孫國(guó)正.面向21世紀(jì)的物流工程及物料搬運(yùn)技術(shù)[J].物流技術(shù)，2001(l)：53-55.
[4]PaloTD,TheVehicleRoutingProblem[J].SocietyforIndustrialandAppliedMathematics,PhiladelPhia,USA,2005:89-123.
[5]楊秋俠.企業(yè)生產(chǎn)物流工序流程的優(yōu)化[J].物流技術(shù)，2005(8)：14-16.
[6]WalshKR,SchneiderH.Theroleofmotivationandriskbehaviorsinsoftwaredevelopmentsuccess[J].InformationResearch,2006:23-30.
[7]真虹，朱云仙.物流裝卸與搬運(yùn)[M].北京：中國(guó)物資出版社，2004.
[8]WilliamsTM.Aclassedbibliographyofrecentresearchrelatingtoprojectriskmanagement.EuropeanJournalofOperationalResearch[M]..2002.
[9]杜平安.制造業(yè)信息化的發(fā)展與現(xiàn)狀研究[J].中國(guó)機(jī)械工程，2003(7)：1126-1130.
[10]孫福權(quán)，于茜.物流系統(tǒng)中的優(yōu)化問(wèn)題研究[J].物流技術(shù)，2006(4)：19-20.
[11]王美瓊.遺傳算法在物流配送路徑規(guī)劃問(wèn)題中的應(yīng)用[D].南京：南京理工大學(xué)，2006.
[12]林清國(guó).基于混合遺傳算法的有時(shí)間窗車輛路徑問(wèn)題研究[D].濟(jì)南：山東大學(xué)，2007.
[13]尚啟超，姜志峰，顧雁宏.裝備物資供應(yīng)保障中的裝卸優(yōu)化方法[J].軍械工程學(xué)院學(xué)報(bào)，2003(9)：45-48.
[14]李濤，張則強(qiáng)，陳文明.裝卸搬運(yùn)在物流中地位及提升策略[J].鐵道貨運(yùn)，2004(6)：33-35.
[15]黃曉英，張劍芳.物料裝卸搬運(yùn)系統(tǒng)分析及改善措施[J].物流技術(shù)，2004(6)：30-32.
[16]宋伯慧，王耀球.裝卸搬運(yùn)設(shè)備配置優(yōu)化研究[J].物流技術(shù)，2006(7)：145-147.
[17]徐文峰.大型物料搬運(yùn)系統(tǒng)綜合設(shè)計(jì)方法研究[D].武漢：華中科技大學(xué)，2008.
[18]殷筑生.企業(yè)物料搬運(yùn)系統(tǒng)工程的設(shè)計(jì)與分析[J].起重運(yùn)輸機(jī)械，2005(10)：23-26.
[19]羅宜美，黃勝延，孫學(xué)慧.基于制造業(yè)生產(chǎn)物流系統(tǒng)的改善與優(yōu)化研究.第十二屆工業(yè)工程和工程管理國(guó)際會(huì)議論文集：下冊(cè)[C].2005.
[20]嚴(yán)伯昌.我國(guó)物料搬運(yùn)設(shè)備的發(fā)展趨勢(shì)[J].產(chǎn)業(yè)透視，2007(9):28-31.
[21]FredEM,MatthewPS.Manufacturingfacilitiesdesignandmaterialhandling.北京：清華大學(xué)出版社,2002
[22]JohnBN.EvolutionaryAlgorithmsforMulti-objectiveOptimizationandDecision-MakingProblems[J].EngineeringScience,2001(12):36.
[23]PietroRomano.Co-ordinationandintegrationmechanismstomanagelogisticsprocessesacrosssupplynetworks[J].JournalofPurchasing&SupplyManagement,2003,9:119-134.
[24]DouglasLambert,JamesStock.Anintegratedmodelandadecomposition-basedapproachforconcurrentlayoutandmaterialhandlingsystemdesign.Computers&IndustrialEngineering,2007,52(4):459-485.
[25]CoelloCA.AnUpdatedSurveyofGA-BasedMulti-objectiveOptimizationTechniques[J].CMComputingSurveys.2005,43(5):231-265.
[26]VenkataRM,GajendraKA.Routingoptimizationinpacketswitchingcommunicationnetworks.EuropeanJournalofOperationalResearch,2008,189(2):492-507.
[27]SangHK.Two-stepsimulationmethodforautomaticmaterialhandlingsystemofsemiconductorfab.RoboticsandComputer-IntegratedManufacturing,2007,23(4):409-420.
[28]楊茅甄.現(xiàn)代物流理論與實(shí)務(wù)[M].上海：上海人民出版社，2003.
[29]林自葵.物流信息管理[M].北京：清華大學(xué)出版社，2006.
[30]曾傳華.物流管理與信息系統(tǒng)[M].北京：清華大學(xué)出版社，2007.
[31]GaoZhi-Yuan.Transformationfromclient/servertoclient/clusterstructureinpowerplantandsubstationautomationsystems[M].AutomationofElectricPowerSystems,2006.
[32]張衛(wèi)德，嚴(yán)洪森，徐成.基于Flexsim的生產(chǎn)線仿真和應(yīng)用[J].工業(yè)控制計(jì)算機(jī)，2005，18(9)：46-47.
[33]張歡歡，黃芳，馬彬榮.基于Flexsim的自動(dòng)化立體倉(cāng)庫(kù)系統(tǒng)的仿真分析[J].南通大學(xué)學(xué)報(bào)，2008，5(1)：19-16.
[34]寶斯琴塔娜，陳紅霞，姜廣君.基于FLEXSIM的流水線生產(chǎn)物流優(yōu)化[M].北京：機(jī)械工業(yè)出版社，2008：20-28.
[35]李永先，胡祥培，熊英.物流系統(tǒng)仿真研究綜述[J].系統(tǒng)仿真學(xué)報(bào)，2007，19(4)：1411-1416.
[36]李新東，程國(guó)全.物流系統(tǒng)規(guī)劃仿真集成化技術(shù)研究[J].物流技術(shù)，2006，(12)：34-36
[37]丁昊凱，許靜雯，謝黎文.ASP.NET網(wǎng)站開發(fā)典型模塊與實(shí)例精講[M].北京：電子工業(yè)出版社，2006：212~215.
[38]Visualwebdeveloper2005expressguidedtour—memberofMicrosoftvisualstudiofamily.
[39]張躍廷，王小科，許文武.ASP.NET數(shù)據(jù)庫(kù)系統(tǒng)開發(fā)案例選[M].北京：人民郵電出版社，2007：281-283.
[40]李春葆，曾慧.SQLServer2005應(yīng)用系統(tǒng)開發(fā)教程[M].北京：清華大學(xué)出版社，2005:19-22.
參考文獻(xiàn)二：
[1]Graham,R.L.Boundsonmultiprocessingfinishinganomalies[J].SIAMJ,1969,17:416-429.
[2]Graham,R.L.Boundsforcertainmultiprocessinganomalies[J].TheBellSystemTech-nicalJournal,1966,45:1563-1581.
[3]黃宜坤.一定條件下平行機(jī)排序問(wèn)題的研究:[碩士學(xué)位論文][D].浙江:浙江大學(xué)，2006:1-28.
[4]徐俊月,戴國(guó)忠,王宏安,生產(chǎn)調(diào)度理論和方法研究綜述[J].計(jì)算機(jī)研究與發(fā)展,2004.41(2):257-267.
[5]Chung-YeeLee.Currenttrendsindeterministicscheduling[J].AnnalsofOperationsResearch,1997,70:1-41.
[6]li.Allahverdi,C.T.Ng,Cheng,T.C.E.,&Mikhail,Y.Kovalyov.Asurveyofschedul-ingproblemswithsetuptimesorcosts[J].EuropeanJournalofOperationalResearch,2008,187:985-1032.
[7]J.Ou,X.Qi,&C.Y.Lee.Parallelmachineschedulingwithmultipleunloadingservers[J].JournalofScheduling,2010,13:213–26.
[8]A.H.Abdekhodaee,A.Wirth,&H.S.Gan.Schedulingparallelmachineswithasingleserver:thegeneralcase[J].ComputersandOperationsResearch,2006,33:994–1009.
[9]A.H.Abdekhodaee,&A.Wirth.Schedulingparallelmachineswithasingleserver:somesolvablecasesandheuristics[J].ComputersandOperationsResearch,2002,29:295–315.
[10]G.Wang,&T.C.E.Cheng.Anapproximationalgorithmforparallelmachineschedul-ingwithacommonserver[J].JournaloftheOperationalResearchSociety,2001,52:234–237.
[11]C.A.Glass,Y.M.Shafransky,&V.A.Strusevich.Schedulingforparalleldedicatedma-chineswithasingleserve[J].WorkingPaperOR86,FacultyofMathematicalStudies,UniversityofSouthampton,UK,1996.
[12]P.Brucker,C.D.Flipo,S.Knust,S.A.Kravchenko,&WernerF.Complexityresultsforparallelmachineproblemswithasingleserver[J].J.Sched.2002,5:429–457.
[13]N.G.Hall,C.N.Potts,&C.Sriskandarajah.Parallelmachineschedulingwithacommonserver[J].DiscreteAppliedMathematics,2000,102:223–243.
[14]S.A.Kravchenko,&F.Werner.Parallelmachineschedulingproblemswithasingleserver[J].MathematicalandComputerModeling,1997,26:1–11.
[15]A.H.Abdekhodaee,A.Wirth,&H.S.Gan.Equalprocessingandequalsetuptimecasesofschedulingparallelmachineswithasingleserver[J].ComputersandOperationsResearch,2004,31:1867–1889.
[16]C.P.Koulamas.Schedulingtwoparallelsemiautomaticmachinestominimizemachineinterference[J].ComputersandOperationsResearch,1996,23:945-956.
[17]L.Zhang,&W.Andrew.On-lineschedulingoftwoparallelmachineswithasingleserver[J].ComputersandOperationsResearch,2009,36:1529–1553.
[18]Y.Azar,J.Naor,&R.Rom.Thecompetitivenessofon-lineassignments[J].JournalofAlgorithms,1995,18:221-237.
[19]W.Tian,Q.Xiong,&J.Cao.Anonlineparallelschedulingmethodwithapplicationtoenergy-efficiencyincloudcomputing[J].JSupercomput,2003,66:1773-1790.
[20]D.Shabtay,&S.Karhi.Anasymptoticallyoptimalonlinealgorithmtominimizethetotalcompletiontimeontwomultipurposemachineswithunitprocessingtimes[J].DiscreteOptimization,2012,4(9):241-248.
[21]Y.Jiang.,J.Dong.,&M.Ji.Preemptiveschedulingontwoparallelmachineswithasingleserver[J].ComputersandIndustrialEngineering,2013,66:514-518.
[22]Xie,X.,Li,Y.,Zhou,H.,&Zheng,Y.Schedulingparallelmachineswithasingleserver[J].InProceedingofInternationalConferenceonMeasurement,InformationandControl,2012,1:453-456.
[23]Xie,X.,Zheng,Y.,&Li,Y.SchedulingparallelmachineswithaSingleServer:ADedi-catedCase[J].InProceedingofFifthInternationalJointConferenceonComputationalSciencesandOptimizations,2012:146-149.
[24]J.Hu.,Q.Zhang.,J.Dong.,&Y.Jiang.Parallelmachinesschedulingwithasingleserver:loadingandunloading[J].COCOA2013,LectureNotesinComputerSciences,2013(8287):106-116.
[25]F.Werner,&S.A.Kravchenko.Schedulingwithmultipleservers[J].AutomationandRemoteControl,2010,71(10):2109–2121.
[26]Yip,Y.,Cheng,C.,&Low,C.SequencingofanMmachineflowshopwithsetup,process-ingandremovaltimesseparated[J].InternationalJournalofAdvancedManufacturingTechnology,2006,30:289-296.
[27]Ganesharajah,T.,&NHall.CSriskandarajah.DesignandoperationalissuesinAGV-servedmanufacturingsystems[J].AnnalsofOperationsResearch,1998,76:109-154.
[28]Dawande,M.,Geismar,H.,Sethi,S.,&Sriskandarajah,C.Sequencingandschedulinginroboticcells:recentdevelopments[J].JournalofScheduling,2005,8:387-426.
[29]Batur,G.,Karasan,O.,&Akturk,M.Multiplepart-typeschedulinginflexibleroboticcells[J].InternationalJournalofProductionEconomics,2012，135(2)：726-740
[30]Kim,M.Y.,&Lee,Y.H.MIPmodelsandhybridalgorithmforminimizingthemakespanofparallelmachinesschedulingproblemwithasingleserver[J].ComputersandOperationsResearch,2012,39:2457-2468.
[31]Su,C.OnlineLPTalgorithmsforparallelmachinesschedulingwithasingleserver[J].JournalofCombnatorialOptimization,2013,26:480-488.
[32]周凌云,趙鋼,孔繼利和鞠紅.物流中心規(guī)劃與設(shè)計(jì)[M].第1版.北京:清華大學(xué)出版社北京交通大學(xué)出版社,2010.
[33]程洪海,劉華群.配送中心管理理論與實(shí)務(wù)[M].第1版.北京:清華大學(xué)出版社北京交通大學(xué)出版社,2011.
[34]朱華.配送中心管理與運(yùn)作[M].第2版.北京:高等教育出版社,2008.
[35]DouglasL.McWilliams,&MarandaE.McBride.Abeamsearchheuristicstosolvetheparcelhubschedulingproblem[J].ComputersandIndustrialEngineering,2012,62:1080-1092.
【物流管理畢業(yè)論文參考文獻(xiàn)】相關(guān)文章：
物流管理專業(yè)畢業(yè)論文參考文獻(xiàn)范例05-15
物流專業(yè)畢業(yè)論文參考文獻(xiàn)09-20