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

Nikolaos Rachaniotis (), Theodore G. Voutsinas and Costas P. Pappis

International Journal of Decision Sciences, Risk and Management, 2013, vol. 5, issue 1, 80-87

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. (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=57535 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijdsrm:v:5:y:2013:i:1:p:80-87

Access Statistics for this article

More articles in International Journal of Decision Sciences, Risk and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().