Periodic Scheduling with Service Constraints

Shoshana Anily () and Julien Bramel ()
Additional contact information
Shoshana Anily: Faculty of Management, Tel-Aviv University, Tel-Aviv, Israel 69978
Julien Bramel: 406 Uris Hall, Columbia University, New York, NY 10027

Operations Research, 2000, vol. 48, issue 4, 635-645

Abstract: We consider the problem of servicing a number of objects in a discrete time environment. In each period, we may select an object that will receive a service in the period. Each time an object is serviced, we incur a servicing cost dependent on the time since the object's last service. Problems of this type appear in many contexts, e.g., multiproduct lot-sizing, machine maintenance, and several problems in telecommunications. We assume that at most one object can be serviced in a given period. For the general problem with m objects, which is known to be (N-script)(P-script)-Hard, we describe properties of an optimal policy, and for the specific case of m = 2 objects, we determine an optimal policy.

Keywords: Inventory/production: policies; maintenance/replacement; Mathematics: Convexity; Analysis of algorithms (search for similar items in EconPapers)
Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.48.4.635.12414 (application/pdf)

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:inm:oropre:v:48:y:2000:i:4:p:635-645

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().