[1] Stalk Jr G. Time-The next source of competitive advantage[J]. Harvard Businness Review, 1988,66(4) :41-51. [2] Hum S H, Sim H H. Time-based competition: literature review and implication for molding[J]. International Journal of Operations & Production Management, 1996, 16(1):75-90. [3] Spekman R,Salmond D, Kamauff J.At last procurement becomes strategic [J]. Long-Range Planning, 1994, 27(2) :76-84. [4] (日)日通综合研究所,吴润涛等译.物流手册[M].北京:中国物资出版社,1986. [5] 杨波,梁樑,唐启鹤.物流配送中心选址的随机数学模型[J].中国管理科学,2002,10(5):57-61. [6] 杨波.多品种随机数学模型的物流配送中心选址问题[J].中国管理科学,2003,11(2):45-49. [7] Barcelo J, Casanovas J. A heuristic Lagrangian algorithm for the capacitated plant location problem[J]. European Journal of Operational Research, 1984,15(2) :212-226. [8] 863/CIMS课题组.供应链多阶响应周期调查报告[R].武汉:华中科技大学管理学院,2002. [9] Bramel J, Simchi-Levi D. The Logic of Logistics-Theory,Algorithms, and Applications for Logistics Management[M]. New York: Springer-Verlag, 1997. [10] Salvendy G.Handbook of Industrial Engineering-Technology and Operations Management (3thed) [M]. New York:John Wiley & Son,2001. [11] Duran M A, Grossmann I E. An outer-approximation algorithm for a class of mixed-integer nonlinear programs[J]. Mathematical Programming, 1986,36 (3): 307-339. [12] Quesada I, Grossmann I E. An LP/NLP based branch and bound algorithm for convex MINL optimization problems[J]. Computers & Chemical Engineering, 1992, 16 (10):937-947. [13] Ceoffrion A M.Generalized benders decomposition [J].Journal of Optimization Theory & Applications. 1972,10(4) :237-260. |