[1] 物料管理實務、理論與資訊化之探討,華泰書局,林清河著,民國83年。
[2] 生產管理,五南圖書出版公司,葛謙編著,賴士葆校訂,民國84年。
[3] 陳佳慧,「以配銷需求規劃為核心的多層級配銷管理模式」,私立大葉工學院工業工程研究所,碩士論文,民國八十五年。[4] 沈應昌,「配銷體系下訂購點存貨管理系統與物流規劃系統(DRP)之比較」,國立台灣大學商學研究所,碩士論文,民國八十三年。[5] 游世民,「結合車輛途程問題(VRP)及配銷需求規劃(DRP)之配銷管理模式」,私立大葉大學工業工程研究所,碩士論文,民國八十七年。[6] 黃金智,「隨機型車輛途程問題解法之研究」,私立大葉大學工業工程研究所,碩士論文,民國八十八年。[7] 賴宏志,「具退化、允缺及線性遞增需求的存貨模式探討」,國立中央大學工業管理研究所,碩士論文,民國八十七年。[8] 廖亮富,「含時窗限制多部車車輛途程問題解算之研究」,私立元智大學工業工程研究所,碩士論文,民國八十七年。[9] Anily, S., “The Vehicle Routing Problem with Delivery and Back-haul Options,” Naval Research Logistics, 43, 415-434 (1996)。
[10] Badeau, P., Guertin, F., Gendreau, M., Potvin, Jean-Yves and Taillard, E., “A Parallel Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows,” Transportation Research, 5(2), 109-122 (1997)。
[11] Bard, F.J., Huang, L., Jaillet, P. and Dror, M., “A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities,” Transportation Science, 32, 189-203 (1998)。
[12] Beltrami, E. and Bodin, L., “Networks and Vehicle Routing for Municipal Waste Collection,” Networks , 4, 65-94 (1974)。
[13] Bertsimas, D.J. and SimchiLevi, D., “A New Generation of Vehicle Routing Research:Robust Algorithms,Addressing Uncertainty,” Operations Research, 44, 286-304 (1996)。
[14] Bodin, L. and Golden, B.,“Classification in Vehicle Routing and Scheduling,” Networks , 11, 97-108 (1981)。
[15] Bookbinder, J.H., and Heath, D.B., “Replenishment Analysis in Distribution Requirements Planning,” Logistics and Transportation Review, 19, 477-489 (1988)。
[16] Bramel, J. and SimchiLevi, D.,“On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows,” Operations Research, 45 , 295-301 (1997)。
[17] Bregman, R.L., “A Heuristic Algorithm for managing inventory in a multi-echelon environment”, Journal of Operations Management, 8, 186-208 (1989)。
[18] Bregman, R.L., “Enhance Distribution Requirements Planning,” Journal of Business Logistics, 14, 49-68 (1990)。
[19] Chen, X., Wan, W. and Xu, X., “Modeling Rolling Batch Planning as Vehicle Routing Problem with Time Windows,” Computers Operations Research, 25(12), 1127-1136 (1998)。
[20] Christofides, N., Mingozzi, A., and Toth, P., “State-space Relaxation Procedures for the Computation of Bounds to Routing Problems,” Networks, 11, 145-164 (1981)。
[21] Desrochers, M., Desrosiers, J. and Solomon, M., “A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows,” Operations Research, 40, 342-354 (1992)。
[22] Dror, M. and Ball, M., “Inventory Routing:Reduction from an Annual to Short Period Problem,” Naval Research Logistics Quarterly,34, 891-905 (1987)。
[23] Duhamel, C., Potvin, J.Y. and Rousseau, J.M., “A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows,” Transportation Science, 31, 49-59 (1997)。
[24] Elsayed, E.A. and Boucher, T.O., Analysis and Control of Production System, Prentice-Hall Inc., N.J. (1985)。
[25] Federguen, A. and Zipkin, P., “A Combined Vehicle Routing and Inventory Allocation Problem,” Operations Research ,32, 1019-1037 (1984)。