期刊文献+

客户满意度视角下面向产品服务系统订单的调度问题研究 被引量:4

The order scheduling problem of product-service systemfrom the perspective of customer satisfaction
下载PDF
导出
摘要 本文基于客户的服务时间窗要求和最晚可接受交付时间,考虑服务型制造企业在交付产品服务系统(PSS)时的客户满意度,研究了一类典型PSS订单的调度优化问题。问题中每个PSS订单需先由多条生产线分别制造产品的各个部件,然后由一支安装团队为客户提供安装服务,以最大化客户满意度总和为目标建立了PSS订单调度问题的优化模型,根据问题特点分别设计了改编的NEH构造型启发式算法和DDE-SA混合元启发式算法来求解模型,在仿真实验中检验了不同调度规则下改编NEH算法和DDE-SA算法的有效性。结果表明,基于几何平均松弛时间递增调度规则的NEH算法的性能优于其他调度规则,适用于时间有限且规模较小的PSS订单调度问题;DDESA算法具有较强的鲁棒性且明显优于单纯的离散差分进化算法和模拟退火算法,适用于时间充足且有较高求解质量要求的大规模PSS订单调度问题。 With the increasingly fierce market competition and the growing demand for personalized service,many traditional manufacturing firms not only sell products,but also provide product service system(PSS)for customers,thus realizing the transformation from product-oriented manufacturing to service-oriented manufacturing.PSS is defined as an integrated solution of products and services.It can not only improve the competitiveness and profitability of manufacturing enterprises,but also improve customer satisfaction and loyalty.Although PSS has many advantages and has been widely used in business,a lot of management problems remain to be solved.Therefore,numbers of scholars focus on PSS and study it extensively in recent years.In the service-oriented manufacturing mode,service quality has become an important driving force for the development of manufacturing firms,and customer satisfaction is an important index to evaluate service quality.For the equipment purchase and installation contract of the common PSS order type in the equipment manufacturing industry(such as elevator,wind power and other industries),customers usually specify the time windows of service start and end.The start time of a time window is the earliest service time allowed,that is,the earliest time service can be provided;before this time,due to the lack of installation conditions or other reasons,the customer cannot accept the service.The end time of a time window is the deadline.Not only will goodwill and customer satisfaction decline,but also the manufacturing firms need to pay a penalty for delayed delivery of services to potential customers.In order to provide service within the time windows required by customers,manufacturing firms must carefully formulate PSS order scheduling strategies to achieve the highest possible customer satisfaction.Therefore,how to optimize customer satisfaction as the goal of PSS order scheduling is an urgent practical problem for service-oriented manufacturing firms.In the PSS order scheduling problem,the product components of each PSS order are first produced by multiple production lines,and then the installation team provides installation services according to the time windows required by customers.Customer satisfaction is characterized by a given time window and the latest acceptable delivery time.In this paper,the mathematical model of PSS order scheduling problem is established with the goal of maximizing the total satisfaction.Considering the NP hard characteristic of the studied problem,seven constructive heuristic algorithms and new scheduling rules based on NEH algorithm are proposed,and a DDESA meta-heuristic algorithm is designed to solve the problem.The performances of the proposed algorithm are examined in computational experiments.The results show that the heuristic algorithms based on the scheduling rules of production idle time,service idle time,geometric average idle time and harmonic average idle time perform better than the other scheduling rules;compared with pure DDE and SA algorithm,DDE-SA algorithm can not only obtain higher quality solutions,but also has strong robustness to the fluctuation of the number of components,delay factors and delivery range factors,which is suitable for large-scale PSS order scheduling problems.The research of this paper is to further deepen and expand the research in the field of scheduling management and service quality management.It can not only enrich the existing theoretical research results of production and operational management,but also fill up the research and application of NEH,DDE and SA algorithms from the perspective of methodology.In the context of global serviceoriented transformation of equipment manufacturing industry,this study can help service-oriented manufacturing firms in construction,medical and elevator industries to schedule PSS orders more scientifically and reasonably,so as to improve the service quality of firms and reduce operating costs.This work can further promote the service-oriented transformation and upgrading of China′s manufacturing industry.
作者 张杨 但斌 高华丽 ZHANG Yang;DAN Bin;GAO Huali(School of Economics and Business Administration,Chongqing University,Chongqing 400044,China;School of Management,Chongqing Technology and Business University,Chongqing 400067,China;Chongqing Key Research Base of Humanities and Social Sciences,Research Center for Enterprise Management of Chongqing Technology and Business University,Chongqing 400067,China;School of Management,Southwest University of Political Science&Law,Chongqing 401120,China)
出处 《管理工程学报》 CSSCI CSCD 北大核心 2021年第5期202-211,共10页 Journal of Industrial Engineering and Engineering Management
基金 国家自然科学基金资助项目(71572020) 国家重点研发计划项目(2018YFB1701502) 2019年重庆市教育委员会人文社会科学研究基地项目(19JD042) 重庆工商大学高层次人才科研启动项目(950319002)。
关键词 产品服务系统 订单调度 客户满意度 NEH算法 离散差分进化算法 Product-service system Order scheduling Customer satisfaction NEH algorithm Discrete differential evolution algorithm
  • 相关文献

参考文献6

二级参考文献60

  • 1卢冰原,陈华平,古春生,谷峰.基于模糊逻辑的偏柔性工作车间调度模型[J].中国管理科学,2004,12(6):52-55. 被引量:5
  • 2周水银,陈荣秋.单机加权成套订单数遗传算法研究[J].系统工程,2005,23(5):22-24. 被引量:16
  • 3宋伟刚,张宏霞,佟玲.有时间窗约束非满载车辆调度问题的节约算法[J].东北大学学报(自然科学版),2006,27(1):65-68. 被引量:30
  • 4周水银,盛培锋.面向成套订单问题的工艺规划与排序的集成研究1[J].中国管理科学,2006,14(5):73-80. 被引量:4
  • 5Simchi-Levi D, Chen Xin, Bramel J. The Logic of Logistics : Theory, Algorithms, and Applications for Logistics and Supply Chain Management[ M]. New York: Springer Science + Business Media, Inc. , 2005. 217-219.
  • 6Fagerholt K. Ship scheduling with soft time windows : An optimization based approach [ J ]. European Journal of Operational Research, 2001, 131 (3) : 559-571.
  • 7Wang X, Regan A C. Local truckload pickup and delivery with hard time window constraints [ J ]. Transportation Research Part B, 2002, 36(2) : 97-112.
  • 8Solomon M. Algorithms for the vehicle routing and scheduling problems with time window constraints [ J ]. Operations Research, 1987, 35(2) : 254-265.
  • 9Clarke G, Wright J W. Scheduling of vehicles from a central depot to a number of delivery points[ J]. Operations Research, 1964, 12(4) : 568-581.
  • 10Bennett B, Gazis D. School bus routing by computer[J]. Transportation Research, 1972, 6(4): 317-326.

共引文献61

同被引文献48

引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部