王秀利
  • 出生年月:1966年7月
  • 籍贯:河北省邱县
  • 民 族: 汉族
  • 政治面貌: 群众
  • 最后学历: 博士研究生毕业
  • 技术职称: 教授
  • 导师类别: 博士生导师
  • 邮箱:wangdu0816@163.com
访问次数 37273 次
更新日期 2019年12月22日
指导学科
  • 主学科1201 管理科学与工程【博士生导师】
  • 研究方向

    1.生产与服务运作管理 2.供应链管理 3.数据挖掘与知识管理

  • 跨学科
  • 二级学科
  • 研究方向
  • 专业学位1251 工商管理
  • 研究方向
获奖、荣誉称号

2014年中国高被引学者(决策科学)

2015年中国高被引学者(决策科学)

2016年中国高被引学者(决策科学)

2017年中国高被引学者(决策科学)

2018年中国高被引学者(决策科学)

科研项目

 

国家自然科学基金面上项目: “集成原材料供应、作业调度和产品配送的供应链问题研究” (批准号 70871059), 主持人。

国家自然科学基金面上项目:“单件订单接受和加工调度优化决策问题研究”(批准号71171114),主持人。

国家自然科学基金面上项目:“单件订单外包报价与加工调度分散决策问题研究”(批准号71571101),主持人。

国家自然科学基金面上项目:“中小呼叫中心异质坐席人员排班调度及路由优化问题研究”(批准号71871118),主持人。

企业委托课题:“程曦电话客服中心来电量预测问题研究”(合同编号M201407012),主持人。

企业委托课题:“中国大陆地区服务产品实证实施与咨询分析”(合同编号M201407022),主持人。

企业委托课题:“关联数据模型及设备状态评估研究”(合同编号M201507032),主持人。

企业委托课题:“技鼎客服中心排班优化模型与算法研究”(合同编号M1171070069),主持人。

发表论文
  1. Xiuli Wang, Sujie Geng and T.C.E. Cheng. “Negotiation mechanisms for an order subcontracting and scheduling problem”. Omega, The International Journal of Management Science (2018) 77, 154-167. (SSCI&SCI)
  2. Xiuli Wang, Guodong Huang, Xiuwu Hu and T.C.E. Cheng. “Order acceptance and scheduling on two identical parallel machines”. Journal of the Operational Research Society (2015) 66(10), 1755-1767. (SSCI&SCI)
  3. Xiuli Wang, Qianqian Zhu and T.C.E. Cheng. “Subcontracting price schemes for order acceptance and scheduling”. Omega, The International Journal of Management Science (2015) 54, 1-10. (SSCI&SCI)
  4. Xiuli Wang and T.C.E. Cheng. “A heuristic for scheduling jobs on two identical parallel machines with a machine availability constraint”. International Journal of Production Economics (2015) 161, 74-82. (SCI)
  5. Xiuli Wang, Xingzi Xie and T.C.E. Cheng. “A modified artificial bee colony algorithm for order acceptance in two-machine flow shops”. International Journal of Production Economics (2013) 141, 14-23. (SCI)
  6. Xiuli Wang, Xingzi Xie and T.C.E. Cheng. “Order acceptance and scheduling in a two-machine flowshop”. International Journal of Production Economics (2013) 141, 366-376. (SCI)
  7. Xiuli Wang and T.C.E. Cheng. “Performance bound analysis of a heuristic for the total weighted flowtime problem with fixed delivery dates”. Computers and Industrial Engineering (2012) 62, 451-456. (SCI)
  8. Xiuli Wang and T.C.E. Cheng. “Production scheduling with supply and delivery considerations to minimize the makespan”. European Journal of Operational Research (2009) 194, 742-752. (SCI)
  9. Xiuli Wang and T.C.E. Cheng. “Heuristics for parallel-machine scheduling with job class setups and delivery to multiple customers”. International Journal of Production Economics (2009) 119, 199-206. (SCI)
  10. Xiuli Wang and T.C.E. Cheng. “Logistics scheduling to minimize inventory and transport costs”. International Journal of Production Economics (2009) 121, 266-273. (SCI)
  11. Xiuli Wang and T.C.E. Cheng. “Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan”. European Journal of Operational Research (2007) 178, 57-70. (SCI)
  12. Xiuli Wang and T.C.E. Cheng. “Machine scheduling with an availability constraint and job delivery coordination”. Naval Research Logistics (2007) 54, 11-20. (SCI)
  13. Xiuli Wang and T.C.E. Cheng. “An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint”. Computers and Operations Research (2007) 34, 2894-2901. (SCI)
  14. Xiuli Wang and T.C.E. Cheng. “Heuristics for two-machine flowshop scheduling with setup times and an availability constraint”. Computers and Operations Research (2007) 34, 152-162. (SCI)
  15. Xiuli Wang and T.C.E. Cheng. “A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups”. Computers and Operations Research (2006) 33, 1326-1344. (SCI)
  16. Xiuli Wang and T.C.E. Cheng. “Single machine scheduling with resource dependent release times and processing times”. European Journal of Operational Research (2005) 162, 727-739. (SCI)
  17. Xiuli Wang and T.C.E. Cheng. “Two-machine flowshop scheduling with job class setups to minimize total flowtime”. Computers and Operations Research (2005) 32, 2751-2770. (SCI)