Article ID: | iaor20021570 |
Country: | United States |
Volume: | 48 |
Issue: | 4 |
Start Page Number: | 635 |
End Page Number: | 645 |
Publication Date: | Jul 2000 |
Journal: | Operations Research |
Authors: | Anily Shoshana, Bramel Julien |
Keywords: | production, scheduling |
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