ON THE TRANSPORTATION FLEET MAINTENANCE SCHEDULING PROBLEM OF A MULTI-FACILITY MAINTENANCE SYSTEM WITH LIMITED CAPACITY

 

Jia-Yen Huang, Ming-Jong Yao

 

Abstract

 

In the real world, the managers of a transportation fleet need to carefully determine the maintenance cycles of vehicles so as to minimize the average total costs (including the operating costs and the maintenance costs). Furthermore, since the maintenance system usually equips with limited manpower and facilities, it has limited capacity to provide maintenance service for the transportation fleet. In this paper, a new and efficient heuristic to solve the transport fleet maintenance scheduling problem in a multi-facility maintenance process with limited capacity is presented. To solve this problem, under the assumption that the maintenance cycle times are integer multiples of a basic period, a search algorithm to obtain the relaxed optimal solution for an unconstrained model is developed. Once a candidate solution of the time multiples are chosen, we determine for each basic period of the global cycle the group of vehicles to be maintained and the sequence to be used. Then a feasibility testing heuristic is performed for each one of these candidate solutions. Finally, among these candidate solutions, we pick the “best” solution that secures a feasible maintenance schedule with the minimum average costs. Based on our experiments, we demonstrate that the proposed search algorithm could effectively solve the Transportation Fleet Maintenance Scheduling Problem in a multi-facility maintenance system with limited capacity.

 

Lecture Notes in Management Science (2011) Vol. 3: 479-498

3rd International Conference on Applied Operational Research, Proceedings

© Tadbir Operational Research Group Ltd. All rights reserved.

www.tadbir.ca

 

ISSN 2008-0050 (Print)

ISSN 1927-0097 (Online)

 

ARTICLE OUTLINE

 

·         Introduction

·         The Model

·         Theoretical Analysis

·         An Approximation Model

·         The Proposed Search Algorithm

·         The Initialization Procedure

·         Secure The Local Optima In The Search Range

·         The Termination Condition For The Search Algorithm

·         The Feasibility Testing Heuristic

·         Generate A Maintenance Schedule

·         The Main Algorithm

·         Numerical Experiments

·         Concluding Remarks

·         Acknowledgement

·         References

 

Full Text PDF