Scheduling periodic preventive maintenance with a single server in a finite horizon
by Nikos P. Rachaniotis; Theodore G. Voutsinas; Costas P. Pappis
International Journal of Decision Sciences, Risk and Management (IJDSRM), Vol. 5, No. 1, 2013

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.

Online publication date: Mon, 30-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Decision Sciences, Risk and Management (IJDSRM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com