中山大學(xué)嶺南學(xué)院導(dǎo)師：張斌 正文

　　姓名：張斌　 　性別：男　　出生年月：1979年11月
　　職稱：副教授　　學(xué)院：嶺南學(xué)院　 最后學(xué)歷：管理學(xué)博士
　　主要研究方向：物流與供應(yīng)鏈管理、收益管理

工作背景：

2009.06- 中山大學(xué)嶺南學(xué)院物流工程與管理系，副教授, 碩士生導(dǎo)師；
2008.02-2009.05 中山大學(xué)嶺南學(xué)院物流工程與管理系，講師；

教育背景：

2002.09-2008.01 中國科學(xué)技術(shù)大學(xué)管理科學(xué)與工程專業(yè)，管理學(xué)博士；
1998.09-2002.07 中國科學(xué)技術(shù)大學(xué)信息管理與信息系統(tǒng)專業(yè)，管理學(xué)學(xué)士；
1998.09-2002.07 中國科學(xué)技術(shù)大學(xué)計算機(jī)應(yīng)用專業(yè)，工學(xué)(雙)學(xué)士；

訪問經(jīng)歷：

2010.01-2010.06 美國麻省理工學(xué)院斯隆管理學(xué)院；
2007.05-2007.12 香港科學(xué)技術(shù)大學(xué)工業(yè)工程與物流管理系；

主要研究興趣：物流與供應(yīng)鏈管理、收益管理、信息管理

承擔(dān)教學(xué)課程：

本科：企業(yè)經(jīng)營實戰(zhàn)模擬、收益管理、管理信息系統(tǒng)、物流通關(guān)實務(wù)、物流配送與運(yùn)輸
研究生：企業(yè)經(jīng)營實戰(zhàn)模擬、收益管理

發(fā)表學(xué)術(shù)論文：

Multi-tier binary solution method for multi-product newsvendor problem with multiple constraints. European Journal of Operational Research, 2012, 218(2), 426–434. (SCI)

Simple solution methods for separable mixed linear and quadratic knapsack problem. Applied Mathematical Modelling, 2012, 36(7), 3245–3256. (SCI) (with Z Hua)

Capacity-constrained multiple-market price discrimination. Computers & Operations Research, 2012, 39, 105–111. (SCI&SSCI)

Optimal policy for a mixed production system with multiple OEM and OBM products. International Journal of Production Economics, 2011, 130: 27-32. (SCI&SSCI)

Heuristic and exact solution method for convex nonlinear knapsack problem. Asia-Pacific Journal of Operational Research, 2011, forthcoming. (with B Chen) (SCI)

Optimal policy and simple algorithm for a deteriorated multi-item EOQ problem. American Journal of Operations Research, 2011, 1(2), 46-50. (with X Wang)

A portfolio approach to multi-product newsboy problem with budget constraint. Computers & Industrial Engineering, 2010, 58: 759-765. (with Z Hua) (SCI&SSCI)

Combined trust model based on evidence theory in iterated prisoner's dilemma game. International Journal of Systems Science, 2011, 42(1):63–80 (with B Chen, W Zhu) (SCI&SSCI)

Multi-product newsboy problem with limited capacity and outsourcing.European Journal of Operational Research, 2010, 202:107-113. (with S Du) (SCI)

A binary solution method for the multi-product newsboy problem with budget constraint. International Journal of Production Economics, 2009, 117:136-141.(with X Xu, Z Hua) (SCI&SSCI)

A unified method for a class of convex separable nonlinear knapsack problem. European Journal of Operational Research, 2008, 191:1-6.(with Z Hua) (SCI)

Improving density forecast by modeling asymmetric features: an application to S&P500 returns. European Journal of Operational Research, 2008, 185(2): 716-725.(with Z Hua) (SCI&SSCI)

A new approach of forecasting intermittent demand for spare parts inventories in the process industries. Journal of the Operational Research Society, 2007, 58(1): 52-61. (with Z Hua, J Yang, D Tan) (SCI&SSCI)

An approximate dynamic programming approach to convex quadratic knapsack problems. Computers & Operations Research, 2006, 33(3): 660-673. (with Z Hua, L Liang) (SCI)

A new variable reduction technique for convex integer quadratic programs. Applied Mathematical Modelling, 2008, 32: 224-231.(with Z Hua,X Xu) (SCI)

A hybrid support vector machines and logistic regression approach for forecasting intermittent demand of spare parts. Applied Mathematics and Computation, 2006, 181(2): 1035-1048.(with Z Hua) (SCI&SSCI)

Heuristics to convex quadratic knapsack problems in sorted ADP. ICIC2006, Springer-Verlag Berlin Heidelberg, Lecture Notes in Computer Science, 2006, 4113: 907-912.(with Z Hua)
 

中山大學(xué)

添加中山大學(xué)學(xué)姐微信，或微信搜索公眾號“考研派小站”，關(guān)注[考研派小站]微信公眾號，在考研派小站微信號輸入[中山大學(xué)考研分?jǐn)?shù)線、中山大學(xué)報錄比、中山大學(xué)考研群、中山大學(xué)學(xué)姐微信、中山大學(xué)考研真題、中山大學(xué)專業(yè)目錄、中山大學(xué)排名、中山大學(xué)保研、中山大學(xué)公眾號、中山大學(xué)研究生招生）]即可在手機(jī)上查看相對應(yīng)中山大學(xué)考研信息或資源。