Periodic scheduling with obligatory vacations
Theoretical Computer Science
Fairness-free periodic scheduling with vacations
ESA'05 Proceedings of the 13th annual European conference on Algorithms
| Hi-index | 0.00 |
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 withm objects, which is known to be NP-Hard, we describe properties of an optimal policy, and for the specific case ofm = 2 objects, we determine an optimal policy.