- 物流管理專業(yè)畢業(yè)論文參考文獻(xiàn) 推薦度：
- 相關(guān)推薦
物流管理專業(yè)畢業(yè)論文參考文獻(xiàn)
參考文獻(xiàn)的引用應(yīng)當(dāng)實(shí)事求是、科學(xué)合理，不可以為了湊數(shù)隨便引用，以下是小編搜集整理的物流管理專業(yè)畢業(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)化問題研究[J].物流技術(shù)，2006(4)：19-20.
[11]王美瓊.遺傳算法在物流配送路徑規(guī)劃問題中的應(yīng)用[D].南京：南京理工大學(xué)，2006.
[12]林清國(guó).基于混合遺傳算法的有時(shí)間窗車輛路徑問題研究[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]GandinoB,Montrucchio,M.Rebaudengo,E.R.AnalysisofanRFID-basedinformationsystemfortrackingandtracinginanagri-foodchain[C].1stAnnualRFIDEurasiaConference,Istanbul,Turkey.2007:143-148.
[21]YahiaZ.RFID-enabledsupplychainsystemswithcomputersimulation[J].Assemblyautomation,2009,29(2):174-83.
[22]BudakE.DesignofanRFID-basedmanufacturingmonitoringandanalysissystem[C].1stAnnualRFIDEurasiaConference.2007:259-64.
[23]何偉，曾雋芳，魏書楷.RFID生產(chǎn)線監(jiān)控及調(diào)度管理系統(tǒng)[J].自動(dòng)化儀表，2010，31(3)：35-37.
[24]田景賀，范玉順，朱云龍.基于現(xiàn)場(chǎng)總線的RFID生產(chǎn)線集成控制系統(tǒng)[J].計(jì)算機(jī)工程.2008，34(3)：258-260.
[25]李庭國(guó).基于無線射頻識(shí)別的物流管理系統(tǒng)的研究[D].長(zhǎng)沙：國(guó)防科學(xué)技術(shù)大學(xué)，2006.
[26]游戰(zhàn)清，劉克勝，張義強(qiáng).無限射頻識(shí)別技術(shù)(RFID)規(guī)劃與實(shí)施[M].北京：電子工業(yè)出版社，2005.
[27]楊后川，葛文君，王春靜.某型數(shù)控加工中心刀具庫的PLC控制[J].機(jī)電產(chǎn)品開發(fā)與創(chuàng)新，2010(2)：55-58.
[28]曉意.物流仿真及典型仿真軟件[J].中國(guó)電子商情，2009(6)：39-45.
[29]陳子俠.物流仿真軟件的應(yīng)用現(xiàn)狀與發(fā)展[J].浙江工商大學(xué)學(xué)報(bào)，2007(4)：29-34.
[30]陳紅霞.基于Flexsim的流水線生產(chǎn)物流優(yōu)化[J].工業(yè)工程與管理，2008(4)：106-125.
[31]張衛(wèi)德.基于Flexsim的生產(chǎn)線仿真研究[J].工業(yè)控制計(jì)算機(jī)，2005，15(9)：46-47.
[32]石宇強(qiáng).基于Flexsim仿真的生產(chǎn)物流系統(tǒng)分析[J].管理技術(shù)，2008(6)：137-143.
[33]高彩芝.基于Flexsim的生產(chǎn)物流系統(tǒng)仿真優(yōu)化設(shè)計(jì)[D].天津：天津大學(xué)，2010.
[34]宋華明，韓玉啟，楊慧.多品種混合型裝配流水線的平衡設(shè)計(jì)[J].中國(guó)機(jī)械工程，2003,14(6)：475-479.
[35]AnonS.RFIDbringsadvantagesofspeedandinformation[J].EIPackagingMagazine.2005(8):16-18.
[36]李雨思.轎車混流總裝配線物料供應(yīng)系統(tǒng)優(yōu)化研究[D].長(zhǎng)春：吉林大學(xué)，2010.
[37]宛劍業(yè)，王永強(qiáng).Flexsim在安全氣囊裝配生產(chǎn)線中的仿真應(yīng)用研究[J].制造技術(shù)與機(jī)床，2008(2)：56-96.
[38]岳濤.RFID關(guān)鍵技術(shù)及其在現(xiàn)代物流中的應(yīng)用研究[D].武漢：武漢理工大學(xué)，2010.
[39]KimB,HeraguS.Ahybridschedulingandcontrolsystemarchitectureforwarehousemanagement.IEEETransactionsonRobotics&Automation,2003(6):23-26.
[40]周曉光.射頻識(shí)別RFID系統(tǒng)設(shè)計(jì)仿真與應(yīng)用[M].北京：人民郵電出版社，2008.
參考文獻(xiàn)二：
[1] Graham, R.L. Bounds on multiprocessing finishing anomalies[J]. SIAM J,1969,17:416-429.
[2] Graham, R.L. Bounds for certain multiprocessing anomalies [J]. The Bell System Tech-nical Journal,1966,45:1563-1581.
[3] 黃宜坤. 一定條件下平行機(jī)排序問題的研究: [碩士學(xué)位論文][D]. 浙江:浙江大學(xué)，2006:1-28.
[4] 徐俊月, 戴國(guó)忠, 王宏安, 生產(chǎn)調(diào)度理論和方法研究綜述[J]. 計(jì)算機(jī)研究與發(fā)展,2004.41(2): 257-267.
[5] Chung-Yee Lee. Current trends in deterministic scheduling[J]. Annals of OperationsResearch,1997,70:1-41.
[6] li. Allahverdi, C. T. Ng, Cheng,T. C. E., & Mikhail, Y. Kovalyov. A survey of schedul-ing problems with setup times or costs[J]. European Journal of Operational Research,2008,187:985-1032.
[7] J. Ou, X. Qi, & C.Y. Lee. Parallel machine scheduling with multiple unloading servers[J].Journal of Scheduling, 2010,13:213–26.
[8] A.H. Abdekhodaee, A. Wirth, & H.S. Gan. Scheduling parallel machines with a singleserver: the general case[J]. Computers and Operations Research, 2006, 33:994–1009.
[9] A.H. Abdekhodaee, & A. Wirth. Scheduling parallel machines with a single server: somesolvable cases and heuristics[J]. Computers and Operations Research, 2002,29:295–315.
[10] G. Wang, & T.C.E. Cheng. An approximation algorithm for parallel machine schedul-ing with a common server[J]. Journal of the Operational Research Society, 2001,52:234–237.
[11] C.A. Glass, Y.M. Shafransky, & V.A. Strusevich. Scheduling for parallel dedicated ma-chines with a single serve[J]. Working Paper OR86, Faculty of Mathematical Studies,University of Southampton, UK, 1996.
[12] P. Brucker, C.D. Flipo, S. Knust, S.A. Kravchenko, & Werner F. Complexity results forparallel machine problems with a single server[J]. J. Sched. 2002,5:429–457.
[13] N.G. Hall, C.N. Potts, & C. Sriskandarajah. Parallel machine scheduling with a commonserver[J]. Discrete Applied Mathematics, 2000,102:223–243.
[14] S.A. Kravchenko, & F. Werner. Parallel machine scheduling problems with a singleserver[J]. Mathematical and Computer Modeling, 1997,26:1–11.
[15] A.H. Abdekhodaee, A. Wirth, & H.S. Gan. Equal processing and equal setup timecases of scheduling parallel machines with a single server[J]. Computers and OperationsResearch, 2004,31:1867–1889.
[16] C.P. Koulamas. Scheduling two parallel semiautomatic machines to minimize machineinterference[J]. Computers and Operations Research, 1996,23:945-956.
[17] L. Zhang, & W. Andrew. On-line scheduling of two parallel machines with a singleserver[J]. Computers and Operations Research, 2009,36:1529–1553.
[18] Y. Azar, J. Naor, & R. Rom. The competitiveness of on-line assignments[J]. Journal ofAlgorithms, 1995,18:221-237.
[19] W.Tian, Q.Xiong, & J.Cao. An online parallel scheduling method with application toenergy-efficiency in cloud computing[J]. J Supercomput, 2003,66: 1773-1790.
[20] D. Shabtay, & S. Karhi. An asymptotically optimal online algorithm to minimize thetotal completion time on two multipurpose machines with unit processing times[J].Discrete Optimization, 2012,4(9):241-248.
[21] Y.Jiang., J.Dong., & M.Ji. Preemptive scheduling on two parallel machines with a singleserver[J]. Computers and Industrial Engineering, 2013,66: 514-518.
[22] Xie,X., Li,Y., Zhou,H., & Zheng,Y. Scheduling parallel machines with a single server[J].In Proceeding of International Conference on Measurement, Information and Control,2012,1:453-456.
[23] Xie,X., Zheng,Y., & Li,Y. Scheduling parallel machines with a Single Server:A Dedi-cated Case[J]. In Proceeding of Fifth International Joint Conference on ComputationalSciences and Optimizations, 2012:146-149.
[24] J.Hu., Q.Zhang., J.Dong., & Y.Jiang. Parallel machines scheduling with a singleserver:loading and unloading[J]. COCOA 2013, Lecture Notes in Computer Sciences,2013(8287):106-116.
[25] F. Werner, & S.A. Kravchenko. Scheduling with multiple servers[J]. Automation andRemote Control, 2010,71(10):2109–2121.
[26] Yip,Y., Cheng,C., & Low,C. Sequencing of an M machine flow shop with setup, process-ing and removal times separated[J]. International Journal of Advanced ManufacturingTechnology, 2006,30:289-296.
[27] Ganesharajah,T., & N Hall. C Sriskandarajah. Design and operational issues in AGV-served manufacturing systems[J]. Annals of Operations Research, 1998,76:109-154.
[28] Dawande, M., Geismar, H., Sethi, S., & Sriskandarajah, C. Sequencing and schedulingin robotic cells: recent developments[J]. Journal of Scheduling, 2005,8:387-426.
[29] Batur, G., Karasan, O., & Akturk, M. Multiple part-type scheduling in flexible roboticcells[J]. International Journal of Production Economics, 2012，135(2)：726-740
[30] Kim, M. Y., & Lee, Y. H. MIP models and hybrid algorithm for minimizing themakespan of parallel machines scheduling problem with a single server[J]. Computersand Operations Research, 2012,39:2457-2468.
[31] Su, C. Online LPT algorithms for parallel machines scheduling with a single server[J].Journal of Combnatorial Optimization, 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] Douglas L. McWilliams, & Maranda E. McBride. A beam search heuristics to solve theparcel hub scheduling problem[J]. Computers and Industrial Engineering, 2012,62:1080-1092.
【物流管理專業(yè)畢業(yè)論文參考文獻(xiàn)】相關(guān)文章：
物流管理專業(yè)畢業(yè)論文參考文獻(xiàn)范例05-15
物流專業(yè)畢業(yè)論文參考文獻(xiàn)09-20
物流專業(yè)畢業(yè)論文參考文獻(xiàn)范例08-07
旅游管理專業(yè)畢業(yè)論文參考文獻(xiàn)05-13