In this study, we propose a new solution approach for the Transportation Fleet Maintenance Scheduling Problem (TFMSP). Before presenting our solution approach, we first review Goyal and Gunasekaran's [International Journal of Systems Science, 23 (1992) 655-659] mathematical model and their search procedure for determining the economic maintenance frequency of a transport fleet. To solve the TFMSP, we conduct a full analysis on the mathematical model. By utilizing our theoretical results, we propose an efficient search algorithm that finds the optimal solution for the TFMSP within a very short run time. Based on our experiments using random data, we conclude that the proposed search algorithm out-performs Goyal and Gunasekaran's search procedure.
|頁（從 - 到）||33-48|
|期刊||Journal of the Operations Research Society of Japan|
|出版狀態||Published - 1 一月 2006|