Minimizing service and operation costs of periodic scheduling

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

Minimizing service and operation costs of periodic scheduling

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

Research output: Contribution to conference › Paper › peer-review

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 language	English (US)
Pages	11-20
Number of pages	10
State	Published - 1998
Externally published	Yes
Event	Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA Duration: Jan 25 1998 → Jan 27 1998

Conference

Conference	Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms
City	San Francisco, CA, USA
Period	1/25/98 → 1/27/98

All Science Journal Classification (ASJC) codes

Software
General Mathematics

Cite this

@conference{a0aa60a0b5e64491b7785d5d725648d2,

title = "Minimizing service and operation costs of periodic scheduling",

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.",

author = "Amotz Bar-Noy and Randeep Bhatia and Joseph Naor and Baruch Schieber",

year = "1998",

language = "English (US)",

pages = "11--20",

note = "Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms ; Conference date: 25-01-1998 Through 27-01-1998",

}

TY - CONF

T1 - Minimizing service and operation costs of periodic scheduling

AU - Bar-Noy, Amotz

AU - Bhatia, Randeep

AU - Naor, Joseph

AU - Schieber, Baruch

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0032257204&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032257204&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0032257204

SP - 11

EP - 20

T2 - Proceedings of the 1998 9th Annual ACM SIAM Symposium on Discrete Algorithms

Y2 - 25 January 1998 through 27 January 1998

ER -

Minimizing service and operation costs of periodic scheduling

Abstract

Conference

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this