A tabu search heuristic for preventive maintenance scheduling

Research output: Contribution to journalArticle

29 Citations (Scopus)

Abstract

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
Volume40
Issue number1-2
DOIs
StatePublished - Jun 2001

Fingerprint

Maintenance Scheduling
Preventive Maintenance
Preventive maintenance
Tabu search
Tabu Search
Scheduling
Heuristics
Scheduling Problem
Schedule
Availability Constraints
Resource Constraints
Diversification
Test Problems
Optimality
Maximise
Availability

Keywords

  • Heuristics
  • Preventive maintenance
  • Scheduling
  • Tabu search

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Cite this

A tabu search heuristic for preventive maintenance scheduling. / Gopalakrishnan, Mohan; Mohan, Srimathy; He, Z.

In: Computers and Industrial Engineering, Vol. 40, No. 1-2, 06.2001, p. 149-160.

Research output: Contribution to journalArticle

@article{6fee11953c424a9ab2a4ea6d1759c081,
title = "A tabu search heuristic for preventive maintenance scheduling",
abstract = "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{\%}.",
keywords = "Heuristics, Preventive maintenance, Scheduling, Tabu search",
author = "Mohan Gopalakrishnan and Srimathy Mohan and Z. He",
year = "2001",
month = "6",
doi = "10.1016/S0360-8352(01)00014-6",
language = "English (US)",
volume = "40",
pages = "149--160",
journal = "Computers and Industrial Engineering",
issn = "0360-8352",
publisher = "Elsevier Limited",
number = "1-2",

}

TY - JOUR

T1 - A tabu search heuristic for preventive maintenance scheduling

AU - Gopalakrishnan, Mohan

AU - Mohan, Srimathy

AU - He, Z.

PY - 2001/6

Y1 - 2001/6

N2 - 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%.

AB - 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%.

KW - Heuristics

KW - Preventive maintenance

KW - Scheduling

KW - Tabu search

UR - http://www.scopus.com/inward/record.url?scp=0035370974&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035370974&partnerID=8YFLogxK

U2 - 10.1016/S0360-8352(01)00014-6

DO - 10.1016/S0360-8352(01)00014-6

M3 - Article

AN - SCOPUS:0035370974

VL - 40

SP - 149

EP - 160

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

SN - 0360-8352

IS - 1-2

ER -