The scheduling of maintenance service

✍ Scribed by Shoshana Anily; Celia A. Glass; Refael Hassin

• Publisher: Elsevier Science
• Year: 1998
• Tongue: English
• Weight: 987 KB
• Volume: 82
• Category: Article
• ISSN: 0166-218X
• DOI: 10.1016/s0166-218x(97)00119-4

✦ Synopsis

We study a discrete problem of scheduling activities of several types under the constramt that at most a single activity can be scheduled to any one period. Applications of such a model arc the scheduling of maintenance service to machines and multi-item replenishment of stock. In this paper we assume that the cost associated with any given type of activity increases linearly with the number of periods since the last execution of this type. The problem is to find an optimal schedule specifying at which periods to execute each of the activity types in order to minimi/c the long-run average cost per period.

We investigate properties of an optimal solution and shorn that there is aluays a cyclic optimal policy. We propose a greedy algorithm and report on computational comparison +ith the optimal. We also provide a heuristic, based on regular cycles for all but one activity type. \ith a guaranteed worse case bound. 0 1998 Hsevier Science B.V. ,411 rights reser,cd.

KcJYI~oY~/~~: Scheduling; Maintenance

We consider an infinite horizon discrete time maintenance problem of 1)~ machines. !Lfi,_. :M,,,. The cost of operating a machine at any given period depends on the number of periods since the last maintenance of that machine. We start with a linear cost structure where each machine i is associated with a constant u, and the cost of operating the machine in the jth period after the last maintenance of that machine is ,jcr;, for ,j 3 0. We assume that no cost is associated with the maintenance service. Each period service may be given to at most one of the machines. The problem is to find an optimal policy specifying at which periods to service each of the machines in order to minimize the long-run average operating cost per period.