IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v48y2000i4p635-645.html
   My bibliography  Save this article

Periodic Scheduling with Service Constraints

Author

Listed:
  • Shoshana Anily

    (Faculty of Management, Tel-Aviv University, Tel-Aviv, Israel 69978)

  • Julien Bramel

    (406 Uris Hall, Columbia University, New York, NY 10027)

Abstract

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-script)(P-script)-Hard, we describe properties of an optimal policy, and for the specific case of m = 2 objects, we determine an optimal policy.

Suggested Citation

  • Shoshana Anily & Julien Bramel, 2000. "Periodic Scheduling with Service Constraints," Operations Research, INFORMS, vol. 48(4), pages 635-645, August.
    • Handle: RePEc:inm:oropre:v:48:y:2000:i:4:p:635-645
    DOI: 10.1287/opre.48.4.635.12414
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.48.4.635.12414
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.48.4.635.12414?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Refael Hassin & Nimrod Megiddo, 1991. "Exact Computation of Optimal Inventory Policies Over an Unbounded Horizon," Mathematics of Operations Research, INFORMS, vol. 16(3), pages 534-546, August.
    2. Glass, Celia A., 1994. "Feasibility of scheduling lot sizes of two frequencies on one machine," European Journal of Operational Research, Elsevier, vol. 75(2), pages 354-364, June.
    3. Celia A. Glass, 1992. "Feasibility of Scheduling Lot Sizes of Three Products on One Machine," Management Science, INFORMS, vol. 38(10), pages 1482-1494, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Maquirriain, Javier & García-Villoria, Alberto & Pastor, Rafael, 2024. "Matheuristics for scheduling of maintenance service with linear operation cost and step function maintenance cost," European Journal of Operational Research, Elsevier, vol. 315(1), pages 73-87.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Amotz Bar-Noy & Randeep Bhatia & Joseph (Seffi) Naor & Baruch Schieber, 2002. "Minimizing Service and Operation Costs of Periodic Scheduling," Mathematics of Operations Research, INFORMS, vol. 27(3), pages 518-544, August.
    2. Perera, Sandun & Janakiraman, Ganesh & Niu, Shun-Chen, 2017. "Optimality of (s, S) policies in EOQ models with general cost structures," International Journal of Production Economics, Elsevier, vol. 187(C), pages 216-228.
    3. Khouja, Moutaz & Michalewicz, Zgibniew & Wilmot, Michael, 1998. "The use of genetic algorithms to solve the economic lot size scheduling problem," European Journal of Operational Research, Elsevier, vol. 110(3), pages 509-524, November.
    4. Daniel Adelman & Diego Klabjan, 2005. "Duality and Existence of Optimal Policies in Generalized Joint Replenishment," Mathematics of Operations Research, INFORMS, vol. 30(1), pages 28-50, February.
    5. Khouja, Moutaz, 1997. "The scheduling of economic lot sizes on volume flexible production systems," International Journal of Production Economics, Elsevier, vol. 48(1), pages 73-86, January.
    6. Seki, Yoichi & Kogure, Keiji, 1996. "Lot scheduling problem for continuous demand," International Journal of Production Economics, Elsevier, vol. 44(1-2), pages 7-15, June.
    7. Daniel Adelman, 2003. "Price-Directed Replenishment of Subsets: Methodology and Its Application to Inventory Routing," Manufacturing & Service Operations Management, INFORMS, vol. 5(4), pages 348-371, May.
    8. Daning Sun, 2004. "Existence and Properties of Optimal Production and Inventory Policies," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 923-934, November.
    9. Khoury, B. N. & Abboud, N. E. & Tannous, M. M., 2001. "The common cycle approach to the ELSP problem with insufficient capacity," International Journal of Production Economics, Elsevier, vol. 73(2), pages 189-199, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:48:y:2000:i:4:p:635-645. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.