Title: Scheduling periodic preventive maintenance with a single server in a finite horizon

Authors: Nikos P. Rachaniotis; Theodore G. Voutsinas; Costas P. Pappis

Addresses: Department of Industrial Management, University of Piraeus, 80 Karaoli and Dimitriou str., 18534 – Piraeus, Hellas – Greece ' Department of Industrial Management, University of Piraeus, 80 Karaoli and Dimitriou str., 18534 – Piraeus, Hellas – Greece ' Department of Industrial Management, University of Piraeus, 80 Karaoli and Dimitriou str., 18534 – Piraeus, Hellas – Greece

Abstract: A deterministic scheduling problem of a single maintenance crew or facility responsible for the periodic preventive maintenance of n machines of a production system is considered. Each machine has a cost (e.g., an environmental emission) that deteriorates over time according to a convex and increasing function. The objective is to find a maintenance sequence policy that optimises the overall efficiency (e.g., minimises the total emission) of the system in a finite horizon, under a continuous time relaxation, i.e., the time is considered continuous and not discrete. The proposed greedy algorithm is proven to yield optimal solutions for the relaxed problem.

Keywords: maintenance scheduling; periodic preventive maintenance; single server; finite horizon; deteriorating jobs; maintenance sequencing; greedy algorithm.

DOI: 10.1504/IJDSRM.2013.057535

International Journal of Decision Sciences, Risk and Management, 2013 Vol.5 No.1, pp.80 - 87

Received: 17 Jul 2013
Accepted: 26 Jul 2013

Published online: 07 Nov 2013 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article