Integrated planning of spare parts and service engineers with partial backlogging

被引:10
作者
Rahimi-Ghahroodi, S. [1 ]
Al Hanbali, A. [1 ]
Zijm, W. H. M. [1 ]
van Ommeren, J. K. W. [2 ]
Sleptchenko, A. [3 ]
机构
[1] Univ Twente, Fac Behav Management & Social Sci, Dept Ind Engn & Business Informat Syst, POB 217, NL-7500 AE Enschede, Netherlands
[2] Univ Twente, Dept Appl Math, Fac Elect Engn Math & Comp Sci, POB 217, NL-7500 AE Enschede, Netherlands
[3] Qatar Univ, Dept Mech & Ind Engn, Coll Engn, POB 2713, Doha, Qatar
关键词
Maintenance logistics; Queueing; Spare parts inventory; Field service; Approximate evaluation; Heuristic optimization; TO-ORDER SYSTEM; QUEUING NETWORK MODEL; LATERAL TRANSSHIPMENTS; CALL CENTER; INVENTORY SYSTEM; SUPPORT-SYSTEM; JOB TYPES; SIMULATION; DECISIONS;
D O I
10.1007/s00291-017-0473-3
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this paper, we consider the integrated planning of resources in a service maintenance logistics system in which spare parts supply and service engineers deployment are considered simultaneously. The objective is to determine close-to-optimal stock levels as well as the number of service engineers that minimize the total average costs under a maximum total average waiting time constraint. When a failure occurs, a spare part and a service engineer are requested for the repair call. In case of a stock-out at spare parts inventory, the repair call will be satisfied entirely via an emergency channel with a fast replenishment time but at a high cost. However, if the requested spare part is in stock, the backlogging policy is followed for engineers. We model the problem as a queueing network. An exact method and two approximations for the evaluation of a given policy are presented. We exploit evaluation methods in a greedy heuristic procedure to optimize this integrated planning. In a numerical study, we show that for problems with more than five types of spare parts it is preferable to use approximate evaluations as they become significantly faster than exact evaluation. Moreover, approximation errors decrease as problems get larger. Furthermore, we test how the greedy optimization heuristic performs compared to other discrete search algorithms in terms of total costs and computation times. Finally, in a rather large case study, we show that we may incur up to 27% cost savings when using the integrated planning as compared to a separated optimization.
引用
收藏
页码:711 / 748
页数:38
相关论文
共 43 条