IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v92y1999i0p143-16410.1023-a1018978529821.html
   My bibliography  Save this article

Recovering cyclic schedules from delay

Author

Listed:
  • R. Wegner

Abstract

A closed single‐server system is considered in which n items are scheduled to circulateat a fixed period. Each service is recognizable and is scheduled for its individual point of time;it is non‐preemptive and its length depends only on which item is being served.Aberratingfrom this desired schedule, some of the items start out with delays. While an item isdelayed,the time between a departure it makes from the server and its next arrival at the server isshortened by an item‐specific parameter. The aim is to recover the regular schedule asearlyas possible, or minimizing the sum of delays on services. All services must be executedeven if delayed.A greedy algorithm for a tractable subproblem is given. The overall problem is proved Σ 2 -hard; some subproblems are proved NP-hard. For one ofthe latter, an approximationalgorithm is given whose performance ratio approaches one if the maximum delay is largeenough relative to other parameters. It is proved that without this natural restriction,therecan be no algorithm with asymptotic performance ratio one. Copyright Kluwer Academic Publishers 1999

Suggested Citation

  • R. Wegner, 1999. "Recovering cyclic schedules from delay," Annals of Operations Research, Springer, vol. 92(0), pages 143-164, January.
    • Handle: RePEc:spr:annopr:v:92:y:1999:i:0:p:143-164:10.1023/a:1018978529821
    DOI: 10.1023/A:1018978529821
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018978529821
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018978529821?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    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:spr:annopr:v:92:y:1999:i:0:p:143-164:10.1023/a:1018978529821. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.