Scheduling maintenance services to three machines

S. Anily, C.A. Glass and R. Hassin

Annals of Operations Research, 1999, vol. 86, issue 0, 375-391

Abstract: We study a discrete problem of scheduling activities of three types under the constraintthat at most a single activity can be scheduled to any one period. Applications of such amodel are the scheduling of maintenance service to machines and multi‐item replenishmentof stock. We assume that the cost associated with any given type of activity increases linearlywith the number of periods since the last execution of this type. The problem is to specifyat which periods to execute each of the activity types in order to minimize the long‐runaverage cost per period. We analyze various forms of optimal solution which may occur,relating them to the combination of the three machine cost constants. Some cases remainunsolved by this method and for these we develop a heuristic whose worst case performanceis no more than 3.33% from the optimal. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018971222185 (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:spr:annopr:v:86:y:1999:i:0:p:375-391:10.1023/a:1018971222185

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018971222185

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().