Research on Distribution of Hobbing Machine Spare Parts with Time Limits

Hu Linqiao, Yan Ping, Jia Fei and Zhou Qiang
Additional contact information
Hu Linqiao: State Key Laboratory of Mechanical Transmission, Chongqing University, Chongqing, China
Yan Ping: State Key Laboratory of Mechanical Transmission, Chongqing University, Chongqing, China
Jia Fei: Chongqing BOE Optoelectronics Technology Co., Ltd, Chongqing, China
Zhou Qiang: State Key Laboratory of Mechanical Transmission, Chongqing University, Chongqing, China

International Journal of Information Systems and Supply Chain Management (IJISSCM), 2016, vol. 9, issue 1, 58-74

Abstract: Distribution of hobbing machine spare parts is a key factor to improve the efficiency of service-oriented spare part allocation. In order to minimize the distribution route, the distribution model of hobbing machine spare parts with time limits was put forward. The modified savings algorithm was adopted to solve the model. To improve the loading rate of classic savings algorithm, the modified savings algorithm allowed the split delivery according to customers' requirements. A case study verified that the application of modified savings algorithm ensured the shortest distribution route and improved the vehicle loading rate.

Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
https://services.igi-global.com/resolvedoi/resolve ... 8/IJISSCM.2016010104 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jisscm:v:9:y:2016:i:1:p:58-74

Access Statistics for this article

International Journal of Information Systems and Supply Chain Management (IJISSCM) is currently edited by John Wang

More articles in International Journal of Information Systems and Supply Chain Management (IJISSCM) from IGI Global
Bibliographic data for series maintained by Journal Editor ().