@article {IOPORT.05033326,
    author       = {Huang, Jia-Yen},
    title        = {New search algorithm for solving the maintenance scheduling problem for a family of machines.},
    year         = {2006},
    journal      = {Optimization Methods \& Software},
    volume       = {21},
    number       = {3},
    issn         = {1055-6788},
    pages        = {461-477},
    publisher    = {Taylor \& Francis, Reading, Berkshire},
    doi          = {10.1080/10556780500104090},
    abstract     = {Summary: In many real-world applications, the cost associate with maintenance could be very significant since the maintenance work is subcontract or repairmen have to make a special trip from some central place to carry out the work. The focus of this study is to optimally coordinate the maintenance schedule of machines to save the maintenance cost incurred, which is named as the maintenance scheduling problem for a family of machines (MSPFM). Before presenting our solution approach, we first review {\it S. K. Goyal} and {\it M. I. Kusy}'s [J. Oper. Res. Soc. 36, 1125--1128 (1985; Zbl 0592.90037)] model and their heuristic for solving the MSPFM. In this study, we conduct full analysis on the mathematical model for the MSPFM. By utilizing our theoretical results, we propose a new search algorithm that solves the optimal solution for the MSPFM very efficiently. Using 36,000 instances randomly generated, we show that our new search algorithm obtains better solutions than Goyal and Kusy's heuristic.},
    identifier   = {05033326},
}