In this study, we propose a new solution approach for solving the Maintenance Scheduling Problem for a Family of Machines (MSPFM). After reviewing the literature, we found that Goyal and Kusy's paper presented the only model that used a nonlinear function for the cost of operating a machine when studying the periodic maintenance scheduling problems. In our presentation of this paper, we first review Goyal and Kusy's mathematical model and their heuristic for solving the MSPFM. By analyzing the mathematical model, we show that the objective function of the MSPFM is Lipschitz. Therefore, we propose to solve the MSPFM using a Lipschitz optimization algorithm with a dynamic Lipschitz constant. Based on our random experiments, we conclude that the proposed dynamic Lipschitz optimization algorithm out-performs Goyal and Kusy's heuristic.
|Number of pages||22|
|Journal||International Journal of Information and Management Sciences|
|State||Published - 1 Dec 2007|
- A family of machines
- Global optimization