Periodic scheduling with service constraints
成果类型：
Article
署名作者：
Anily, S; Bramel, J
署名单位：
Tel Aviv University; Columbia University
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.48.4.635.12414
发表日期：
2000
页码：
635-645
关键词：
摘要：
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 P-Hard, we describe properties of an optimal policy; and for the specific case of m = 2 objects, we determine an optimal policy.