A tabu search heuristic for preventive maintenance scheduling

Research output: Contribution to journalArticlepeer-review

35 Scopus citations


In this paper, we present a tabu search based heuristic, PM_TABU, for the preventive maintenance (PM) scheduling problem. The PM scheduling problem aims to maximize the total priority of the scheduled tasks subject to resource availability constraints. The heuristic involves three basic moves - adding a PM task to the current schedule, dropping a task from the schedule and swapping craft-combinations assigned to a task. The heuristic also incorporates the probabilistic intensification and diversification feature introduced by Rochat and Taillard (J. Heuristics, 1 (1995) 147). We have tested our heuristic on 60 problems used by Gopalakrishnan, Ahire and Miller (Manag. Sci., 43 (1997) 827) in their study. PM_TABU reduces the average optimality gap for the test problems from 2.26 (obtained from Gopalakrishnan et al., Manag. Sci., 43 (1997) 827) to 0.60%.

Original languageEnglish (US)
Pages (from-to)149-160
Number of pages12
JournalComputers and Industrial Engineering
Issue number1-2
StatePublished - Jun 2001


  • Heuristics
  • Preventive maintenance
  • Scheduling
  • Tabu search

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)


Dive into the research topics of 'A tabu search heuristic for preventive maintenance scheduling'. Together they form a unique fingerprint.

Cite this