Minimizing service and operation costs of periodic scheduling

Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber

Research output: Contribution to conferencePaperpeer-review

75 Scopus citations

Abstract

The problem of scheduling activities of several types is investigated under the constraint that at most, a fixed number of activities can be scheduled in any single time-slot. Any given activity type is associated with a service cost and an operating cost that increases linearly with the number of time-slots since the last service of this type. The problem is to find an optimal schedule that minimizes the long-run average cost per time-slot.

Original languageEnglish (US)
Pages11-20
Number of pages10
StatePublished - Dec 1 1998
Externally publishedYes
EventProceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA
Duration: Jan 25 1998Jan 27 1998

Conference

ConferenceProceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms
CitySan Francisco, CA, USA
Period1/25/981/27/98

All Science Journal Classification (ASJC) codes

  • Chemical Health and Safety
  • Software
  • Safety, Risk, Reliability and Quality
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Minimizing service and operation costs of periodic scheduling'. Together they form a unique fingerprint.

Cite this